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-f4eb214f-m [2019-10-13 17:50:45,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:50:45,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:50:45,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:50:45,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:50:45,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:50:45,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:50:45,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:50:45,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:50:45,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:50:45,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:50:45,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:50:45,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:50:45,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:50:45,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:50:45,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:50:45,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:50:45,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:50:45,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:50:45,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:50:45,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:50:45,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:50:45,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:50:45,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:50:45,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:50:45,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:50:45,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:50:45,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:50:45,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:50:45,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:50:45,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:50:45,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:50:45,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:50:45,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:50:45,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:50:45,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:50:45,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:50:45,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:50:45,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:50:45,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:50:45,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:50:45,281 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-13 17:50:45,315 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:50:45,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:50:45,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:50:45,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:50:45,320 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:50:45,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:50:45,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:50:45,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:50:45,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:50:45,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:50:45,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:50:45,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:50:45,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:50:45,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:50:45,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:50:45,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:50:45,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:50:45,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:50:45,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:50:45,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:50:45,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:50:45,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:50:45,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:50:45,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:50:45,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:50:45,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:50:45,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:50:45,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:50:45,622 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:50:45,623 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-13 17:50:45,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64304774b/c8e54ccc9e2642c3a751393fb75ad16a/FLAG92a943461 [2019-10-13 17:50:46,185 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:50:46,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c [2019-10-13 17:50:46,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64304774b/c8e54ccc9e2642c3a751393fb75ad16a/FLAG92a943461 [2019-10-13 17:50:46,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64304774b/c8e54ccc9e2642c3a751393fb75ad16a [2019-10-13 17:50:46,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:50:46,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:50:46,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:50:46,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:50:46,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:50:46,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b073ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46, skipping insertion in model container [2019-10-13 17:50:46,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:50:46,617 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:50:46,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:50:46,824 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:50:46,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:50:46,873 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:50:46,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46 WrapperNode [2019-10-13 17:50:46,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:50:46,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:50:46,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:50:46,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:50:46,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:46,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:47,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:47,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (1/1) ... [2019-10-13 17:50:47,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:50:47,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:50:47,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:50:47,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:50:47,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (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-13 17:50:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:50:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:50:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 17:50:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:50:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:50:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 17:50:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 17:50:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 17:50:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:50:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:50:47,374 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:50:47,374 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 17:50:47,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:47 BoogieIcfgContainer [2019-10-13 17:50:47,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:50:47,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:50:47,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:50:47,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:50:47,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:50:46" (1/3) ... [2019-10-13 17:50:47,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6187617a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:47, skipping insertion in model container [2019-10-13 17:50:47,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:46" (2/3) ... [2019-10-13 17:50:47,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6187617a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:47, skipping insertion in model container [2019-10-13 17:50:47,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:47" (3/3) ... [2019-10-13 17:50:47,391 INFO L109 eAbstractionObserver]: Analyzing ICFG nr3.c [2019-10-13 17:50:47,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:50:47,408 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:50:47,419 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:50:47,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:50:47,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:50:47,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:50:47,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:50:47,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:50:47,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:50:47,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:50:47,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:50:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-13 17:50:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 17:50:47,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:47,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:47,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:47,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-13 17:50:47,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:47,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652764826] [2019-10-13 17:50:47,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:47,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:47,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:47,743 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-13 17:50:47,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652764826] [2019-10-13 17:50:47,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:47,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 17:50:47,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223871876] [2019-10-13 17:50:47,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:50:47,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:50:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:50:47,764 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-13 17:50:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:48,020 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-13 17:50:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:50:48,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 17:50:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:48,033 INFO L225 Difference]: With dead ends: 60 [2019-10-13 17:50:48,033 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 17:50:48,039 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-13 17:50:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 17:50:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-13 17:50:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 17:50:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-13 17:50:48,102 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-13 17:50:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:48,103 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-13 17:50:48,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:50:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-13 17:50:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 17:50:48,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:48,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:48,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-13 17:50:48,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:48,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655506211] [2019-10-13 17:50:48,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,361 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-13 17:50:48,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655506211] [2019-10-13 17:50:48,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:48,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:50:48,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060820009] [2019-10-13 17:50:48,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:50:48,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:50:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:50:48,366 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-13 17:50:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:48,485 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-13 17:50:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:50:48,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 17:50:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:48,489 INFO L225 Difference]: With dead ends: 52 [2019-10-13 17:50:48,490 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 17:50:48,491 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-13 17:50:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 17:50:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-13 17:50:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 17:50:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-13 17:50:48,499 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-13 17:50:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:48,500 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-13 17:50:48,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:50:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-13 17:50:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 17:50:48,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:48,501 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-13 17:50:48,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-13 17:50:48,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:48,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575554273] [2019-10-13 17:50:48,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,571 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-13 17:50:48,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575554273] [2019-10-13 17:50:48,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:48,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:50:48,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069243622] [2019-10-13 17:50:48,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 17:50:48,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:48,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 17:50:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:50:48,574 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-13 17:50:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:48,644 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-13 17:50:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:50:48,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-13 17:50:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:48,646 INFO L225 Difference]: With dead ends: 56 [2019-10-13 17:50:48,647 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 17:50:48,647 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-13 17:50:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 17:50:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-13 17:50:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 17:50:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 17:50:48,655 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-13 17:50:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:48,656 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 17:50:48,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 17:50:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 17:50:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 17:50:48,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:48,657 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-13 17:50:48,657 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-13 17:50:48,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:48,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242856562] [2019-10-13 17:50:48,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,740 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-13 17:50:48,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242856562] [2019-10-13 17:50:48,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:48,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:50:48,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579130650] [2019-10-13 17:50:48,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:50:48,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:50:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:50:48,744 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-13 17:50:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:48,827 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-13 17:50:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:50:48,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-13 17:50:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:48,828 INFO L225 Difference]: With dead ends: 57 [2019-10-13 17:50:48,829 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 17:50:48,829 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-13 17:50:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 17:50:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-13 17:50:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 17:50:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 17:50:48,839 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-13 17:50:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:48,841 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 17:50:48,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:50:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 17:50:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 17:50:48,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:48,844 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-13 17:50:48,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-13 17:50:48,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:48,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244278068] [2019-10-13 17:50:48,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:48,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,956 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-13 17:50:48,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244278068] [2019-10-13 17:50:48,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365993310] [2019-10-13 17:50:48,957 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-13 17:50:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:49,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 17:50:49,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:49,094 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-13 17:50:49,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:49,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-13 17:50:49,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108597015] [2019-10-13 17:50:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:50:49,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:50:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:50:49,097 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-13 17:50:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:49,179 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-10-13 17:50:49,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:50:49,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-13 17:50:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:49,181 INFO L225 Difference]: With dead ends: 61 [2019-10-13 17:50:49,181 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 17:50:49,182 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-13 17:50:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 17:50:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-13 17:50:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 17:50:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-13 17:50:49,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-10-13 17:50:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:49,189 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-13 17:50:49,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:50:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-13 17:50:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 17:50:49,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:49,191 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-13 17:50:49,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:49,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-10-13 17:50:49,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:49,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269749644] [2019-10-13 17:50:49,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:49,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:49,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:49,513 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-13 17:50:49,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269749644] [2019-10-13 17:50:49,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556696188] [2019-10-13 17:50:49,514 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-13 17:50:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:49,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:50:49,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:49,608 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-13 17:50:49,608 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:49,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-13 17:50:49,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985898501] [2019-10-13 17:50:49,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 17:50:49,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 17:50:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 17:50:49,617 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-10-13 17:50:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:49,763 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-13 17:50:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:50:49,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-13 17:50:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:49,765 INFO L225 Difference]: With dead ends: 64 [2019-10-13 17:50:49,765 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 17:50:49,766 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-13 17:50:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 17:50:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-13 17:50:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 17:50:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 17:50:49,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-10-13 17:50:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:49,780 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 17:50:49,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 17:50:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 17:50:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 17:50:49,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:49,784 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-13 17:50:49,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:49,991 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-10-13 17:50:49,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:49,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073267079] [2019-10-13 17:50:49,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:49,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:49,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:50,064 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-13 17:50:50,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073267079] [2019-10-13 17:50:50,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178504492] [2019-10-13 17:50:50,065 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-13 17:50:50,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:50:50,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:50,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:50:50,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:50,125 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-13 17:50:50,126 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:50,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-13 17:50:50,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977353797] [2019-10-13 17:50:50,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:50:50,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:50,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:50:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:50:50,129 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-13 17:50:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:50,241 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2019-10-13 17:50:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:50:50,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-13 17:50:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:50,243 INFO L225 Difference]: With dead ends: 65 [2019-10-13 17:50:50,243 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 17:50:50,245 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-13 17:50:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 17:50:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 17:50:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 17:50:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-13 17:50:50,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-10-13 17:50:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:50,256 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-13 17:50:50,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:50:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-13 17:50:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 17:50:50,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:50,259 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-13 17:50:50,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:50,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-10-13 17:50:50,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:50,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380220481] [2019-10-13 17:50:50,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:50,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:50,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:51,091 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-13 17:50:51,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380220481] [2019-10-13 17:50:51,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989684281] [2019-10-13 17:50:51,092 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-13 17:50:51,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:50:51,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:51,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 17:50:51,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:51,192 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-13 17:50:51,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:51,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:51,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:51,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-10-13 17:50:51,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:51,289 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-13 17:50:51,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:51,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:51,313 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-13 17:50:51,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:73 [2019-10-13 17:50:51,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:51,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:51,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:51,410 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-13 17:50:51,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:51,470 INFO L567 ElimStorePlain]: treesize reduction 27, result has 77.3 percent of original size [2019-10-13 17:50:51,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,475 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-13 17:50:51,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:92 [2019-10-13 17:50:51,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:51,934 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-13 17:50:51,935 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:51,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 22 [2019-10-13 17:50:51,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847839133] [2019-10-13 17:50:51,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 17:50:51,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 17:50:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:50:51,937 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 22 states. [2019-10-13 17:50:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:53,617 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-10-13 17:50:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 17:50:53,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-10-13 17:50:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:53,623 INFO L225 Difference]: With dead ends: 125 [2019-10-13 17:50:53,623 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 17:50:53,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 17:50:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 17:50:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 61. [2019-10-13 17:50:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 17:50:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-10-13 17:50:53,642 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 28 [2019-10-13 17:50:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:53,642 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-10-13 17:50:53,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 17:50:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-10-13 17:50:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 17:50:53,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:53,644 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-13 17:50:53,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:53,848 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:53,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash 612803125, now seen corresponding path program 1 times [2019-10-13 17:50:53,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:53,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96824052] [2019-10-13 17:50:53,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:53,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:53,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:54,073 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-13 17:50:54,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96824052] [2019-10-13 17:50:54,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814478505] [2019-10-13 17:50:54,073 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-13 17:50:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:54,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 17:50:54,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:54,244 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-13 17:50:54,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:54,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 17:50:54,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:54,318 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-13 17:50:54,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,342 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-10-13 17:50:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,344 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-13 17:50:54,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:39 [2019-10-13 17:50:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,874 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-13 17:50:54,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:54,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-10-13 17:50:54,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275661718] [2019-10-13 17:50:54,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 17:50:54,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 17:50:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-10-13 17:50:54,877 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 26 states. [2019-10-13 17:50:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:56,523 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2019-10-13 17:50:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 17:50:56,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-13 17:50:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:56,531 INFO L225 Difference]: With dead ends: 152 [2019-10-13 17:50:56,531 INFO L226 Difference]: Without dead ends: 136 [2019-10-13 17:50:56,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 17:50:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-13 17:50:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-10-13 17:50:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-13 17:50:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-10-13 17:50:56,553 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 37 [2019-10-13 17:50:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:56,553 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-10-13 17:50:56,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 17:50:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-10-13 17:50:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 17:50:56,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:56,556 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-13 17:50:56,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:56,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1104036981, now seen corresponding path program 3 times [2019-10-13 17:50:56,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:56,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981951538] [2019-10-13 17:50:56,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:56,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:56,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,686 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-13 17:50:57,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981951538] [2019-10-13 17:50:57,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882517566] [2019-10-13 17:50:57,687 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-13 17:50:57,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-13 17:50:57,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:57,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 17:50:57,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:57,932 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-13 17:50:57,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:57,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:57,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:57,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-10-13 17:50:58,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:58,045 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-13 17:50:58,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:58,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:58,060 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-13 17:50:58,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2019-10-13 17:50:58,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:58,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:58,151 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-13 17:50:58,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:58,210 INFO L567 ElimStorePlain]: treesize reduction 44, result has 62.1 percent of original size [2019-10-13 17:50:58,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,212 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-13 17:50:58,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:72 [2019-10-13 17:50:58,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:50:58,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:58,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:58,633 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-13 17:50:58,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:58,687 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.9 percent of original size [2019-10-13 17:50:58,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,688 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-13 17:50:58,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:63 [2019-10-13 17:50:58,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:58,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:58,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:58,945 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-13 17:50:58,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:58,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,047 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-13 17:50:59,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,203 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-13 17:50:59,204 INFO L567 ElimStorePlain]: treesize reduction 167, result has 48.1 percent of original size [2019-10-13 17:50:59,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,206 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-13 17:50:59,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:155 [2019-10-13 17:50:59,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:27,631 WARN L191 SmtUtils]: Spent 28.21 s on a formula simplification that was a NOOP. DAG size: 62 [2019-10-13 17:51:27,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 17:51:27,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:27,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:51:27,852 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-13 17:51:27,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:51:27,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:27,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:51:27,971 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-13 17:51:27,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:51:27,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:28,157 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-13 17:51:28,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:51:28,158 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-13 17:51:28,159 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 17:51:28,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:28,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:28,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:51:28,257 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-13 17:51:28,258 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 17:51:28,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:28,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:51:28,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:51:28,294 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-13 17:51:28,295 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 17:51:28,838 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 103 [2019-10-13 17:51:28,838 INFO L567 ElimStorePlain]: treesize reduction 454, result has 56.2 percent of original size [2019-10-13 17:51:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,846 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-13 17:51:28,846 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:387, output treesize:545 [2019-10-13 17:51:28,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:28,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms