/usr/bin/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/nr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:52:33,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:52:33,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:52:33,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:52:33,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:52:33,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:52:33,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:52:33,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:52:33,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:52:33,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:52:33,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:52:33,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:52:33,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:52:33,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:52:33,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:52:33,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:52:33,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:52:33,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:52:33,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:52:33,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:52:33,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:52:33,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:52:33,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:52:33,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:52:33,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:52:33,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:52:33,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:52:33,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:52:33,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:52:33,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:52:33,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:52:33,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:52:33,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:52:33,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:52:33,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:52:33,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:52:33,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:52:33,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:52:33,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:52:33,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:52:33,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:52:33,943 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-11-06 18:52:33,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:52:33,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:52:33,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:52:33,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:52:33,981 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:52:33,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:52:33,981 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:52:33,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:52:33,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:52:33,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:52:33,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:52:33,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:52:33,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:52:33,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:52:33,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:52:33,985 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:52:33,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:52:33,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:52:33,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:52:33,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:52:33,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:52:33,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:52:33,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:52:33,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:52:33,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:52:33,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:52:33,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:52:33,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:52:33,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:52:34,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:52:34,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:52:34,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:52:34,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:52:34,322 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:52:34,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr5.c [2019-11-06 18:52:34,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9481d3f/a06aa363848343fc820c1010a584a09e/FLAGb6daa405f [2019-11-06 18:52:34,806 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:52:34,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr5.c [2019-11-06 18:52:34,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9481d3f/a06aa363848343fc820c1010a584a09e/FLAGb6daa405f [2019-11-06 18:52:35,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9481d3f/a06aa363848343fc820c1010a584a09e [2019-11-06 18:52:35,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:52:35,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:52:35,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:35,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:52:35,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:52:35,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec017b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35, skipping insertion in model container [2019-11-06 18:52:35,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,244 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:52:35,266 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:52:35,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:35,502 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:52:35,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:35,648 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:52:35,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35 WrapperNode [2019-11-06 18:52:35,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:35,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:52:35,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:52:35,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:52:35,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (1/1) ... [2019-11-06 18:52:35,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:52:35,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:52:35,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:52:35,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:52:35,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (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-11-06 18:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:52:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:52:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:52:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:52:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:52:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:52:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:52:36,064 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:52:36,065 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:52:36,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:36 BoogieIcfgContainer [2019-11-06 18:52:36,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:52:36,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:52:36,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:52:36,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:52:36,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:52:35" (1/3) ... [2019-11-06 18:52:36,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0e7fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:36, skipping insertion in model container [2019-11-06 18:52:36,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:35" (2/3) ... [2019-11-06 18:52:36,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0e7fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:36, skipping insertion in model container [2019-11-06 18:52:36,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:36" (3/3) ... [2019-11-06 18:52:36,085 INFO L109 eAbstractionObserver]: Analyzing ICFG nr5.c [2019-11-06 18:52:36,109 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:52:36,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:52:36,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:52:36,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:52:36,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:52:36,168 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:52:36,168 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:52:36,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:52:36,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:52:36,168 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:52:36,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:52:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 18:52:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:52:36,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,193 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-11-06 18:52:36,205 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,205 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455733574] [2019-11-06 18:52:36,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:36,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455733574] [2019-11-06 18:52:36,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:36,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 18:52:36,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491732720] [2019-11-06 18:52:36,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:52:36,469 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:52:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:36,487 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-11-06 18:52:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:36,759 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-11-06 18:52:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:52:36,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 18:52:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:36,774 INFO L225 Difference]: With dead ends: 60 [2019-11-06 18:52:36,775 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 18:52:36,785 INFO L630 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-11-06 18:52:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 18:52:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 18:52:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 18:52:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 18:52:36,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-11-06 18:52:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:36,843 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 18:52:36,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:52:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 18:52:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:52:36,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,846 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-11-06 18:52:36,847 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248353570] [2019-11-06 18:52:36,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248353570] [2019-11-06 18:52:37,069 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:37,069 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:37,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539834865] [2019-11-06 18:52:37,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:37,074 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:37,075 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-11-06 18:52:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,181 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-11-06 18:52:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:37,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 18:52:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,186 INFO L225 Difference]: With dead ends: 52 [2019-11-06 18:52:37,186 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 18:52:37,187 INFO L630 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-11-06 18:52:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 18:52:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-06 18:52:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 18:52:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 18:52:37,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-06 18:52:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,197 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 18:52:37,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 18:52:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 18:52:37,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:37,199 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-11-06 18:52:37,200 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:37,200 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742750201] [2019-11-06 18:52:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742750201] [2019-11-06 18:52:37,257 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:37,257 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:52:37,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651310818] [2019-11-06 18:52:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:52:37,258 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:52:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:52:37,259 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-06 18:52:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,359 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-11-06 18:52:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:52:37,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-06 18:52:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,361 INFO L225 Difference]: With dead ends: 56 [2019-11-06 18:52:37,361 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:52:37,362 INFO L630 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-11-06 18:52:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:52:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-06 18:52:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 18:52:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 18:52:37,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-11-06 18:52:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,370 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 18:52:37,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:52:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 18:52:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:52:37,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,372 INFO L410 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-11-06 18:52:37,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-11-06 18:52:37,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:37,373 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509537066] [2019-11-06 18:52:37,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,457 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509537066] [2019-11-06 18:52:37,457 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:37,457 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:37,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636142934] [2019-11-06 18:52:37,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:37,459 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:37,461 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-11-06 18:52:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,558 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-06 18:52:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:52:37,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:52:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,560 INFO L225 Difference]: With dead ends: 57 [2019-11-06 18:52:37,560 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:52:37,561 INFO L630 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-11-06 18:52:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:52:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 18:52:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 18:52:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 18:52:37,568 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-11-06 18:52:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,568 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 18:52:37,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 18:52:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:52:37,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,569 INFO L410 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-11-06 18:52:37,570 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-11-06 18:52:37,570 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:37,571 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228202351] [2019-11-06 18:52:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,667 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228202351] [2019-11-06 18:52:37,667 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500193316] [2019-11-06 18:52:37,668 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-11-06 18:52:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:52:37,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,763 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:37,763 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-06 18:52:37,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251829976] [2019-11-06 18:52:37,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:37,764 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:37,765 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-11-06 18:52:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,847 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-11-06 18:52:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:52:37,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:52:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,848 INFO L225 Difference]: With dead ends: 61 [2019-11-06 18:52:37,848 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:52:37,849 INFO L630 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-11-06 18:52:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:52:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-11-06 18:52:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 18:52:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 18:52:37,856 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-11-06 18:52:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,856 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 18:52:37,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 18:52:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:52:37,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,857 INFO L410 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-11-06 18:52:38,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,061 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-11-06 18:52:38,061 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:38,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135940995] [2019-11-06 18:52:38,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135940995] [2019-11-06 18:52:38,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420495211] [2019-11-06 18:52:38,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-06 18:52:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:38,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,231 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:38,231 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-06 18:52:38,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31159702] [2019-11-06 18:52:38,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 18:52:38,232 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:38,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 18:52:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:52:38,233 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-11-06 18:52:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:38,339 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-06 18:52:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:38,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-06 18:52:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:38,341 INFO L225 Difference]: With dead ends: 63 [2019-11-06 18:52:38,341 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:52:38,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:52:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:52:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-06 18:52:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 18:52:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 18:52:38,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-11-06 18:52:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:38,348 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 18:52:38,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 18:52:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 18:52:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:52:38,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:38,349 INFO L410 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-11-06 18:52:38,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-11-06 18:52:38,554 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:38,554 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588560348] [2019-11-06 18:52:38,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588560348] [2019-11-06 18:52:38,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658225034] [2019-11-06 18:52:38,628 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-11-06 18:52:38,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:38,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:38,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:38,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:38,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-06 18:52:38,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519276731] [2019-11-06 18:52:38,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:52:38,686 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:52:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:38,687 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-11-06 18:52:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:38,781 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-06 18:52:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:38,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-06 18:52:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:38,783 INFO L225 Difference]: With dead ends: 67 [2019-11-06 18:52:38,784 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 18:52:38,784 INFO L630 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-11-06 18:52:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 18:52:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-06 18:52:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 18:52:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-06 18:52:38,792 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-11-06 18:52:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:38,792 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-06 18:52:38,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:52:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-06 18:52:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:52:38,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:38,794 INFO L410 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-11-06 18:52:38,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,998 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-11-06 18:52:38,999 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:39,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983110418] [2019-11-06 18:52:39,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:39,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983110418] [2019-11-06 18:52:39,087 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057959498] [2019-11-06 18:52:39,087 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-11-06 18:52:39,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:39,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:39,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 18:52:39,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:39,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:39,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-11-06 18:52:39,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520582332] [2019-11-06 18:52:39,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 18:52:39,201 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 18:52:39,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 18:52:39,202 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2019-11-06 18:52:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:39,307 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-11-06 18:52:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:52:39,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-06 18:52:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:39,309 INFO L225 Difference]: With dead ends: 69 [2019-11-06 18:52:39,309 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 18:52:39,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 18:52:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 18:52:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-06 18:52:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 18:52:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-06 18:52:39,322 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-11-06 18:52:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:39,322 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-06 18:52:39,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 18:52:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-06 18:52:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:52:39,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:39,326 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:39,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:39,531 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 3 times [2019-11-06 18:52:39,532 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:39,532 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759616549] [2019-11-06 18:52:39,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:39,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759616549] [2019-11-06 18:52:39,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393421303] [2019-11-06 18:52:39,633 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 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-11-06 18:52:39,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:52:39,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:39,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:39,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 18:52:39,729 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:39,730 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-11-06 18:52:39,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987862277] [2019-11-06 18:52:39,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 18:52:39,733 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 18:52:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:52:39,734 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2019-11-06 18:52:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:39,898 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-06 18:52:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 18:52:39,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-06 18:52:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:39,900 INFO L225 Difference]: With dead ends: 74 [2019-11-06 18:52:39,901 INFO L226 Difference]: Without dead ends: 44 [2019-11-06 18:52:39,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:52:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-06 18:52:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-06 18:52:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 18:52:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-11-06 18:52:39,911 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2019-11-06 18:52:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:39,912 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-11-06 18:52:39,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 18:52:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-11-06 18:52:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 18:52:39,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:39,915 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:40,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:40,119 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1980068480, now seen corresponding path program 3 times [2019-11-06 18:52:40,120 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:40,120 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554458684] [2019-11-06 18:52:40,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:40,219 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554458684] [2019-11-06 18:52:40,219 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923238806] [2019-11-06 18:52:40,219 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-11-06 18:52:40,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 18:52:40,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:40,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:40,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 18:52:40,292 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:40,292 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-11-06 18:52:40,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079596693] [2019-11-06 18:52:40,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 18:52:40,293 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 18:52:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 18:52:40,293 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 11 states. [2019-11-06 18:52:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:40,508 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-06 18:52:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 18:52:40,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-06 18:52:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:40,510 INFO L225 Difference]: With dead ends: 81 [2019-11-06 18:52:40,510 INFO L226 Difference]: Without dead ends: 44 [2019-11-06 18:52:40,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-11-06 18:52:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-06 18:52:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-06 18:52:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 18:52:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-06 18:52:40,517 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 34 [2019-11-06 18:52:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:40,517 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-06 18:52:40,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 18:52:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-06 18:52:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 18:52:40,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:40,518 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:40,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:40,723 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -700204802, now seen corresponding path program 4 times [2019-11-06 18:52:40,724 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:40,725 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865764435] [2019-11-06 18:52:40,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:41,345 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865764435] [2019-11-06 18:52:41,346 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856798282] [2019-11-06 18:52:41,346 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:41,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:52:41,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:41,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-06 18:52:41,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:41,474 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-11-06 18:52:41,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:52:41,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,566 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-11-06 18:52:41,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-06 18:52:41,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2019-11-06 18:52:41,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,724 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-11-06 18:52:41,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-11-06 18:52:41,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:41,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2019-11-06 18:52:41,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:41,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:41,895 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-11-06 18:52:41,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:77 [2019-11-06 18:52:42,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:42,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:42,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 68 [2019-11-06 18:52:42,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:42,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:42,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:42,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:84, output treesize:80 [2019-11-06 18:52:42,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:42,292 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:42,292 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2019-11-06 18:52:42,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411548728] [2019-11-06 18:52:42,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 18:52:42,293 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 18:52:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-06 18:52:42,294 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 30 states. [2019-11-06 18:52:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:44,839 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2019-11-06 18:52:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-06 18:52:44,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-11-06 18:52:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:44,844 INFO L225 Difference]: With dead ends: 128 [2019-11-06 18:52:44,844 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 18:52:44,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-11-06 18:52:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 18:52:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 46. [2019-11-06 18:52:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 18:52:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-06 18:52:44,865 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2019-11-06 18:52:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:44,866 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-06 18:52:44,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 18:52:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-06 18:52:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 18:52:44,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:44,867 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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-11-06 18:52:45,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:45,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash -490976331, now seen corresponding path program 1 times [2019-11-06 18:52:45,069 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:45,070 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669225932] [2019-11-06 18:52:45,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:45,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669225932] [2019-11-06 18:52:45,382 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72818183] [2019-11-06 18:52:45,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:45,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 18:52:45,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:45,599 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-11-06 18:52:45,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:45,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:52:45,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,709 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-11-06 18:52:45,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:45,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-06 18:52:45,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:45,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2019-11-06 18:52:45,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:45,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:45,888 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-11-06 18:52:45,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:58 [2019-11-06 18:52:45,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:45,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:46,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:46,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 169 [2019-11-06 18:52:46,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:46,093 INFO L567 ElimStorePlain]: treesize reduction 75, result has 56.9 percent of original size [2019-11-06 18:52:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:46,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:99 [2019-11-06 18:52:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:47,892 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-06 18:52:49,906 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 89 [2019-11-06 18:52:50,407 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 18:52:50,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 18:52:57,080 WARN L191 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2019-11-06 18:52:57,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:57,190 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:57,191 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-11-06 18:52:57,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902241767] [2019-11-06 18:52:57,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 18:52:57,192 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 18:52:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2019-11-06 18:52:57,193 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 33 states. [2019-11-06 18:53:00,096 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-06 18:53:02,031 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-06 18:53:02,372 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-11-06 18:53:03,552 WARN L191 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-11-06 18:53:05,947 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 155 DAG size of output: 98 [2019-11-06 18:53:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:06,716 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-11-06 18:53:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:53:06,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-11-06 18:53:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:06,718 INFO L225 Difference]: With dead ends: 114 [2019-11-06 18:53:06,718 INFO L226 Difference]: Without dead ends: 98 [2019-11-06 18:53:06,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2019-11-06 18:53:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-06 18:53:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2019-11-06 18:53:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 18:53:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-06 18:53:06,738 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 43 [2019-11-06 18:53:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:06,738 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-06 18:53:06,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-06 18:53:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-06 18:53:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:53:06,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:06,741 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:06,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:06,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash -532162850, now seen corresponding path program 2 times [2019-11-06 18:53:06,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:06,945 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866122598] [2019-11-06 18:53:06,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:07,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866122598] [2019-11-06 18:53:07,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981988616] [2019-11-06 18:53:07,323 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:07,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:53:07,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:07,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-06 18:53:07,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:07,507 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-11-06 18:53:07,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:07,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:07,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:07,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:53:07,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:07,593 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-11-06 18:53:07,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:07,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:07,606 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-11-06 18:53:07,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-06 18:53:07,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:07,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:07,706 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 38 treesize of output 113 [2019-11-06 18:53:07,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:07,759 INFO L567 ElimStorePlain]: treesize reduction 48, result has 58.6 percent of original size [2019-11-06 18:53:07,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,764 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-11-06 18:53:07,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:68 [2019-11-06 18:53:07,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:08,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:09,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:53:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:09,644 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-11-06 18:53:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:09,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:09,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2019-11-06 18:53:09,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404925850] [2019-11-06 18:53:09,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-06 18:53:09,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-06 18:53:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 18:53:09,747 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 38 states. [2019-11-06 18:53:10,404 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-06 18:53:13,517 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-06 18:53:13,711 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-06 18:53:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:14,071 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2019-11-06 18:53:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-06 18:53:14,071 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-11-06 18:53:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:14,073 INFO L225 Difference]: With dead ends: 110 [2019-11-06 18:53:14,073 INFO L226 Difference]: Without dead ends: 108 [2019-11-06 18:53:14,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=417, Invalid=2889, Unknown=0, NotChecked=0, Total=3306 [2019-11-06 18:53:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-06 18:53:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-11-06 18:53:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-06 18:53:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-11-06 18:53:14,106 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 52 [2019-11-06 18:53:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:14,107 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-11-06 18:53:14,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-06 18:53:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-11-06 18:53:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 18:53:14,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:14,111 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:14,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:14,317 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash -280245803, now seen corresponding path program 3 times [2019-11-06 18:53:14,317 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:14,318 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681773577] [2019-11-06 18:53:14,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:14,665 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681773577] [2019-11-06 18:53:14,665 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139584698] [2019-11-06 18:53:14,666 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:14,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 18:53:14,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:14,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 18:53:14,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:14,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-11-06 18:53:14,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:14,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:14,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:14,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-06 18:53:14,884 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-06 18:53:14,885 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 31 treesize of output 30 [2019-11-06 18:53:14,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:14,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:14,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:14,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-06 18:53:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 18:53:15,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:15,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-11-06 18:53:15,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355089978] [2019-11-06 18:53:15,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 18:53:15,527 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 18:53:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-11-06 18:53:15,528 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 31 states. [2019-11-06 18:53:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:17,890 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2019-11-06 18:53:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-06 18:53:17,891 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2019-11-06 18:53:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:17,892 INFO L225 Difference]: With dead ends: 142 [2019-11-06 18:53:17,892 INFO L226 Difference]: Without dead ends: 121 [2019-11-06 18:53:17,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=483, Invalid=2709, Unknown=0, NotChecked=0, Total=3192 [2019-11-06 18:53:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-06 18:53:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-11-06 18:53:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-06 18:53:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-11-06 18:53:17,910 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 61 [2019-11-06 18:53:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:17,910 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-11-06 18:53:17,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 18:53:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-11-06 18:53:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 18:53:17,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:17,912 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:18,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:18,116 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2107070046, now seen corresponding path program 4 times [2019-11-06 18:53:18,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:18,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984600298] [2019-11-06 18:53:18,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 12 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:18,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984600298] [2019-11-06 18:53:18,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458894109] [2019-11-06 18:53:18,798 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:18,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:53:18,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:18,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-06 18:53:18,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:18,985 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-11-06 18:53:18,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:18,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:18,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:18,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:53:19,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,072 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-11-06 18:53:19,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:19,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:19,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-06 18:53:19,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2019-11-06 18:53:19,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:19,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,234 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-11-06 18:53:19,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-11-06 18:53:19,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2019-11-06 18:53:19,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:19,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 18:53:19,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-06 18:53:19,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:19,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:19,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 207 [2019-11-06 18:53:19,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.