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/nr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:49:43,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:49:43,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:49:43,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:49:43,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:49:43,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:49:43,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:49:43,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:49:43,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:49:43,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:49:43,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:49:43,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:49:43,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:49:43,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:49:43,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:49:43,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:49:43,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:49:43,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:49:43,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:49:43,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:49:43,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:49:43,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:49:43,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:49:43,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:49:43,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:49:43,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:49:43,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:49:43,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:49:43,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:49:43,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:49:43,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:49:43,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:49:43,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:49:43,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:49:43,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:49:43,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:49:43,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:49:43,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:49:43,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:49:43,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:49:43,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:49:43,333 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:49:43,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:49:43,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:49:43,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:49:43,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:49:43,355 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:49:43,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:49:43,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:49:43,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:49:43,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:49:43,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:49:43,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:49:43,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:49:43,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:49:43,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:49:43,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:49:43,359 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:49:43,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:49:43,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:49:43,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:49:43,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:49:43,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:49:43,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:43,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:49:43,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:49:43,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:49:43,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:49:43,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:49:43,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:49:43,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:49:43,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:49:43,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:49:43,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:49:43,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:49:43,659 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:49:43,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3.c [2019-10-14 21:49:43,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f73e9f67/60a382b40456489c98d9111a566ab975/FLAG8ee2a4478 [2019-10-14 21:49:44,108 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:49:44,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c [2019-10-14 21:49:44,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f73e9f67/60a382b40456489c98d9111a566ab975/FLAG8ee2a4478 [2019-10-14 21:49:44,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f73e9f67/60a382b40456489c98d9111a566ab975 [2019-10-14 21:49:44,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:49:44,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:49:44,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:44,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:49:44,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:49:44,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44, skipping insertion in model container [2019-10-14 21:49:44,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:49:44,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:49:44,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:44,763 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:49:44,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:44,800 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:49:44,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44 WrapperNode [2019-10-14 21:49:44,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:44,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:49:44,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:49:44,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:49:44,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (1/1) ... [2019-10-14 21:49:44,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:49:44,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:49:44,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:49:44,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:49:44,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (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:49:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:49:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:49:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:49:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:49:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:49:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:49:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:49:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:49:45,271 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:49:45,272 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:49:45,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:45 BoogieIcfgContainer [2019-10-14 21:49:45,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:49:45,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:49:45,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:49:45,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:49:45,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:49:44" (1/3) ... [2019-10-14 21:49:45,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7717a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:45, skipping insertion in model container [2019-10-14 21:49:45,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:44" (2/3) ... [2019-10-14 21:49:45,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7717a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:45, skipping insertion in model container [2019-10-14 21:49:45,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:45" (3/3) ... [2019-10-14 21:49:45,290 INFO L109 eAbstractionObserver]: Analyzing ICFG nr3.c [2019-10-14 21:49:45,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:49:45,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:49:45,340 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:49:45,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:49:45,362 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:49:45,362 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:49:45,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:49:45,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:49:45,363 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:49:45,363 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:49:45,363 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:49:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:49:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:45,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:45,383 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:49:45,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:45,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 21:49:45,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:45,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8882728] [2019-10-14 21:49:45,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:45,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:45,658 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:49:45,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8882728] [2019-10-14 21:49:45,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:45,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:49:45,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99103750] [2019-10-14 21:49:45,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:45,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:45,682 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-14 21:49:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:45,902 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 21:49:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:45,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:49:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:45,914 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:49:45,914 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:49:45,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:49:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:49:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:49:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:49:45,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 21:49:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:45,967 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:49:45,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:49:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:45,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:45,970 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:49:45,971 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 21:49:45,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:45,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102864186] [2019-10-14 21:49:45,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:45,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:45,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,196 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:49:46,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102864186] [2019-10-14 21:49:46,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:46,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:46,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688837038] [2019-10-14 21:49:46,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:46,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:46,200 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-14 21:49:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:46,308 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 21:49:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:46,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:49:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:46,312 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:49:46,312 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:49:46,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:49:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 21:49:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:49:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 21:49:46,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 21:49:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:46,323 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 21:49:46,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 21:49:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 21:49:46,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:46,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:46,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 21:49:46,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:46,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137076462] [2019-10-14 21:49:46,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,413 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:49:46,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137076462] [2019-10-14 21:49:46,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:46,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:49:46,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575498036] [2019-10-14 21:49:46,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:49:46,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:49:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:46,416 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-14 21:49:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:46,492 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 21:49:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:49:46,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 21:49:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:46,495 INFO L225 Difference]: With dead ends: 56 [2019-10-14 21:49:46,495 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:46,495 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:49:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 21:49:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 21:49:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 21:49:46,509 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 21:49:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:46,511 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 21:49:46,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:49:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 21:49:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:46,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:46,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:46,513 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 21:49:46,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:46,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720113367] [2019-10-14 21:49:46,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:46,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720113367] [2019-10-14 21:49:46,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:46,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:46,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147450985] [2019-10-14 21:49:46,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:46,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:46,602 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-14 21:49:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:46,668 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 21:49:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:46,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:46,669 INFO L225 Difference]: With dead ends: 57 [2019-10-14 21:49:46,670 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:46,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 21:49:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:49:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 21:49:46,677 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 21:49:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:46,678 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 21:49:46,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 21:49:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:46,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:46,679 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:46,679 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 21:49:46,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:46,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232088690] [2019-10-14 21:49:46,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:46,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232088690] [2019-10-14 21:49:46,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7729338] [2019-10-14 21:49:46,759 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:49:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:46,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:49:46,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:46,841 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:46,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 21:49:46,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922917062] [2019-10-14 21:49:46,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:46,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:46,843 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-14 21:49:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:46,935 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-10-14 21:49:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:46,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:46,937 INFO L225 Difference]: With dead ends: 61 [2019-10-14 21:49:46,937 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:49:46,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:49:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-14 21:49:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:49:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 21:49:46,944 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-10-14 21:49:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:46,945 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 21:49:46,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 21:49:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:46,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:46,946 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:47,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:47,152 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-10-14 21:49:47,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:47,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033272203] [2019-10-14 21:49:47,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:47,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:47,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:47,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033272203] [2019-10-14 21:49:47,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090277661] [2019-10-14 21:49:47,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:49:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:47,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:47,308 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:47,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-14 21:49:47,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801320050] [2019-10-14 21:49:47,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:49:47,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:49:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:47,310 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-10-14 21:49:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:47,431 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-14 21:49:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:47,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-14 21:49:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:47,433 INFO L225 Difference]: With dead ends: 64 [2019-10-14 21:49:47,433 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 21:49:47,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 21:49:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-14 21:49:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 21:49:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-14 21:49:47,441 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-10-14 21:49:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:47,442 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-14 21:49:47,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:49:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-14 21:49:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:47,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:47,445 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, 1] [2019-10-14 21:49:47,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:47,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-10-14 21:49:47,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:47,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575561249] [2019-10-14 21:49:47,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:47,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:47,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:47,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575561249] [2019-10-14 21:49:47,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248548867] [2019-10-14 21:49:47,727 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 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:49:47,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:47,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:47,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:47,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:47,786 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:47,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-14 21:49:47,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905988197] [2019-10-14 21:49:47,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:47,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:47,789 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-14 21:49:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:47,870 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2019-10-14 21:49:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:47,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-14 21:49:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:47,871 INFO L225 Difference]: With dead ends: 65 [2019-10-14 21:49:47,871 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 21:49:47,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 21:49:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-14 21:49:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 21:49:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 21:49:47,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-10-14 21:49:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:47,879 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 21:49:47,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 21:49:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:49:47,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:47,880 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:48,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:48,084 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-10-14 21:49:48,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:48,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752160451] [2019-10-14 21:49:48,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:48,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752160451] [2019-10-14 21:49:48,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831138255] [2019-10-14 21:49:48,649 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 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:49:48,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:48,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:48,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 21:49:48,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:48,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:49:48,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:48,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:48,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:48,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-10-14 21:49:48,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:48,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-10-14 21:49:48,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:48,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:48,886 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:49:48,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:73 [2019-10-14 21:49:48,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:48,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:49,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:49,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 96 [2019-10-14 21:49:49,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:49,059 INFO L567 ElimStorePlain]: treesize reduction 27, result has 77.3 percent of original size [2019-10-14 21:49:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:49,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:92 [2019-10-14 21:49:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,497 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:49,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 22 [2019-10-14 21:49:49,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807827716] [2019-10-14 21:49:49,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:49:49,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:49:49,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:49:49,499 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 22 states. [2019-10-14 21:49:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,071 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-10-14 21:49:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-14 21:49:51,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-10-14 21:49:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,078 INFO L225 Difference]: With dead ends: 125 [2019-10-14 21:49:51,078 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 21:49:51,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 21:49:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 21:49:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 61. [2019-10-14 21:49:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 21:49:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-10-14 21:49:51,097 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 28 [2019-10-14 21:49:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,097 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-10-14 21:49:51,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:49:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-10-14 21:49:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 21:49:51,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,099 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:51,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,302 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 612803125, now seen corresponding path program 1 times [2019-10-14 21:49:51,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:51,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789257347] [2019-10-14 21:49:51,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789257347] [2019-10-14 21:49:51,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793708665] [2019-10-14 21:49:51,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:49:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 21:49:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:51,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:49:51,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:51,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:51,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:51,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:49:51,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:51,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-10-14 21:49:51,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:51,775 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-10-14 21:49:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,777 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:49:51,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:39 [2019-10-14 21:49:51,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:51,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:52,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:52,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:52,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:52,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-10-14 21:49:52,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337422152] [2019-10-14 21:49:52,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 21:49:52,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 21:49:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:49:52,270 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 26 states. [2019-10-14 21:49:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:53,807 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2019-10-14 21:49:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:49:53,814 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-14 21:49:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:53,817 INFO L225 Difference]: With dead ends: 152 [2019-10-14 21:49:53,817 INFO L226 Difference]: Without dead ends: 136 [2019-10-14 21:49:53,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2019-10-14 21:49:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-14 21:49:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-10-14 21:49:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-14 21:49:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-10-14 21:49:53,864 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 37 [2019-10-14 21:49:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:53,865 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-10-14 21:49:53,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 21:49:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-10-14 21:49:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:49:53,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:53,875 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:54,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:54,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1104036981, now seen corresponding path program 3 times [2019-10-14 21:49:54,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:54,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716270153] [2019-10-14 21:49:54,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:54,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:54,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:54,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716270153] [2019-10-14 21:49:54,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206332443] [2019-10-14 21:49:54,994 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 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:49:55,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-14 21:49:55,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:55,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:49:55,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:55,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:49:55,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:55,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:55,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:55,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-10-14 21:49:55,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:55,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-10-14 21:49:55,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:55,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:55,388 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:49:55,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2019-10-14 21:49:55,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:55,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:55,479 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 3 case distinctions, treesize of input 36 treesize of output 105 [2019-10-14 21:49:55,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:55,535 INFO L567 ElimStorePlain]: treesize reduction 44, result has 62.1 percent of original size [2019-10-14 21:49:55,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,536 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:49:55,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:72 [2019-10-14 21:49:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:49:55,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:55,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:55,962 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 3 case distinctions, treesize of input 36 treesize of output 105 [2019-10-14 21:49:55,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:56,009 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.9 percent of original size [2019-10-14 21:49:56,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,011 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:49:56,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:63 [2019-10-14 21:49:56,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:56,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:56,233 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 2 case distinctions, treesize of input 57 treesize of output 134 [2019-10-14 21:49:56,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:56,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:56,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:56,306 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 5 case distinctions, treesize of input 67 treesize of output 223 [2019-10-14 21:49:56,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:56,458 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-14 21:49:56,458 INFO L567 ElimStorePlain]: treesize reduction 167, result has 48.1 percent of original size [2019-10-14 21:49:56,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,461 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 2 xjuncts. [2019-10-14 21:49:56,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:155 [2019-10-14 21:49:56,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:32,917 WARN L191 SmtUtils]: Spent 36.22 s on a formula simplification that was a NOOP. DAG size: 62 [2019-10-14 21:50:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-14 21:50:33,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,138 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 5 case distinctions, treesize of input 82 treesize of output 238 [2019-10-14 21:50:33,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,239 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 5 case distinctions, treesize of input 76 treesize of output 242 [2019-10-14 21:50:33,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,409 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-14 21:50:33,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 351 [2019-10-14 21:50:33,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 98 [2019-10-14 21:50:33,470 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 187 [2019-10-14 21:50:33,535 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:34,047 WARN L191 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 103 [2019-10-14 21:50:34,048 INFO L567 ElimStorePlain]: treesize reduction 471, result has 55.3 percent of original size [2019-10-14 21:50:34,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2019-10-14 21:50:34,055 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:387, output treesize:545 [2019-10-14 21:50:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:34,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms