/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/AutomizerCInline.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-6598664 [2019-11-23 20:46:19,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:19,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:19,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:19,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:19,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:19,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:19,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:19,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:19,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:19,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:19,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:19,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:19,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:19,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:19,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:19,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:19,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:19,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:19,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:19,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:19,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:19,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:19,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:19,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:19,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:19,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:19,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:19,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:19,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:19,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:19,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:19,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:19,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:19,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:19,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:19,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:19,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:19,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:19,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:19,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:19,073 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-23 20:46:19,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:19,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:19,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:19,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:19,095 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:19,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:19,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:19,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:19,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:19,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:19,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:19,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:19,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:19,097 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:19,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:19,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:19,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:19,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:19,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:19,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:19,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:19,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:19,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:19,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:19,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:19,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:19,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:19,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:19,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:19,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:19,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:19,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:19,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:19,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:19,421 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:19,422 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-23 20:46:19,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388e2ebfc/d339a87af3784527a9992ac814bf4932/FLAG4c0dc39d9 [2019-11-23 20:46:19,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:19,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr5.c [2019-11-23 20:46:19,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388e2ebfc/d339a87af3784527a9992ac814bf4932/FLAG4c0dc39d9 [2019-11-23 20:46:20,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388e2ebfc/d339a87af3784527a9992ac814bf4932 [2019-11-23 20:46:20,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:20,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:20,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:20,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:20,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:20,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc62c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20, skipping insertion in model container [2019-11-23 20:46:20,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:20,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:20,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:20,562 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:20,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:20,600 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:20,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20 WrapperNode [2019-11-23 20:46:20,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:20,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:20,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:20,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:20,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:20,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:20,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:20,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:20,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (1/1) ... [2019-11-23 20:46:20,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:20,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:20,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:20,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:20,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (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-23 20:46:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:20,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:46:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:46:21,108 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:21,108 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 20:46:21,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:21 BoogieIcfgContainer [2019-11-23 20:46:21,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:21,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:21,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:21,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:21,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:20" (1/3) ... [2019-11-23 20:46:21,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712ed09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:21, skipping insertion in model container [2019-11-23 20:46:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:20" (2/3) ... [2019-11-23 20:46:21,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712ed09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:21, skipping insertion in model container [2019-11-23 20:46:21,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:21" (3/3) ... [2019-11-23 20:46:21,120 INFO L109 eAbstractionObserver]: Analyzing ICFG nr5.c [2019-11-23 20:46:21,130 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:21,136 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:21,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:21,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:21,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:21,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:21,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:21,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:21,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:21,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:21,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-23 20:46:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:21,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:21,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:21,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2072761718, now seen corresponding path program 1 times [2019-11-23 20:46:21,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:21,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912182267] [2019-11-23 20:46:21,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:21,391 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-23 20:46:21,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912182267] [2019-11-23 20:46:21,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:21,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:21,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947332876] [2019-11-23 20:46:21,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:21,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:21,411 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-11-23 20:46:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:21,499 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-11-23 20:46:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:21,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:21,511 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:21,511 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:21,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-11-23 20:46:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 20:46:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-23 20:46:21,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2019-11-23 20:46:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:21,546 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-23 20:46:21,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-23 20:46:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:21,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:21,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:21,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2072821300, now seen corresponding path program 1 times [2019-11-23 20:46:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:21,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387803993] [2019-11-23 20:46:21,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:21,768 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-23 20:46:21,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387803993] [2019-11-23 20:46:21,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:21,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:21,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489491475] [2019-11-23 20:46:21,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:21,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:21,772 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-11-23 20:46:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:21,842 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-23 20:46:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:21,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:21,844 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:46:21,844 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:21,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-23 20:46:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:46:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 20:46:21,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 20:46:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:21,856 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 20:46:21,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 20:46:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:46:21,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:21,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:21,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash -594620155, now seen corresponding path program 1 times [2019-11-23 20:46:21,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:21,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589880137] [2019-11-23 20:46:21,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:21,926 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-23 20:46:21,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589880137] [2019-11-23 20:46:21,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:21,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:46:21,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430651420] [2019-11-23 20:46:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:46:21,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:46:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:21,929 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-23 20:46:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:21,950 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-23 20:46:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:46:21,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 20:46:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:21,952 INFO L225 Difference]: With dead ends: 40 [2019-11-23 20:46:21,952 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 20:46:21,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 20:46:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-23 20:46:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:46:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:46:21,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-23 20:46:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:21,958 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:46:21,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:46:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:46:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:46:21,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:21,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:21,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2056923621, now seen corresponding path program 1 times [2019-11-23 20:46:21,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:21,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880490920] [2019-11-23 20:46:21,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:22,007 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-23 20:46:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880490920] [2019-11-23 20:46:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78387216] [2019-11-23 20:46:22,008 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-23 20:46:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:22,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:46:22,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:22,087 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-23 20:46:22,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:22,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 20:46:22,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326714365] [2019-11-23 20:46:22,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:22,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:22,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:22,093 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-23 20:46:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:22,146 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-11-23 20:46:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:22,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 20:46:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:22,148 INFO L225 Difference]: With dead ends: 44 [2019-11-23 20:46:22,148 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:46:22,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:46:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-23 20:46:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-23 20:46:22,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2019-11-23 20:46:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:22,155 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-23 20:46:22,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-23 20:46:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:22,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:22,156 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:22,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:22,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:22,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1686195899, now seen corresponding path program 2 times [2019-11-23 20:46:22,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:22,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571830677] [2019-11-23 20:46:22,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:22,460 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-23 20:46:22,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571830677] [2019-11-23 20:46:22,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235708667] [2019-11-23 20:46:22,461 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:22,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:22,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:22,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:46:22,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:22,534 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-23 20:46:22,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:22,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-23 20:46:22,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685248200] [2019-11-23 20:46:22,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:46:22,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:22,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:46:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:22,542 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-11-23 20:46:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:22,592 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-23 20:46:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:22,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-23 20:46:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:22,593 INFO L225 Difference]: With dead ends: 50 [2019-11-23 20:46:22,594 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 20:46:22,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 20:46:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-23 20:46:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:46:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-23 20:46:22,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 20 [2019-11-23 20:46:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:22,600 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-23 20:46:22,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:46:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-23 20:46:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:22,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:22,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:22,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:22,811 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 302452187, now seen corresponding path program 3 times [2019-11-23 20:46:22,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:22,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653544589] [2019-11-23 20:46:22,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:22,901 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-23 20:46:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653544589] [2019-11-23 20:46:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790539732] [2019-11-23 20:46:22,902 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:22,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:46:22,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:22,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:46:22,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:22,976 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-23 20:46:22,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-23 20:46:22,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87026528] [2019-11-23 20:46:22,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:46:22,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:46:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:46:22,981 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 8 states. [2019-11-23 20:46:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:23,081 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-11-23 20:46:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 20:46:23,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-23 20:46:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:23,082 INFO L225 Difference]: With dead ends: 57 [2019-11-23 20:46:23,082 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 20:46:23,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:46:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 20:46:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-23 20:46:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 20:46:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-23 20:46:23,089 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 23 [2019-11-23 20:46:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:23,090 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-23 20:46:23,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:46:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-23 20:46:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:46:23,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:23,091 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:23,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:23,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 790158109, now seen corresponding path program 1 times [2019-11-23 20:46:23,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:23,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569793818] [2019-11-23 20:46:23,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:24,008 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-23 20:46:24,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569793818] [2019-11-23 20:46:24,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481984617] [2019-11-23 20:46:24,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-23 20:46:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:24,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:46:24,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:24,128 INFO L377 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-23 20:46:24,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:24,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,215 INFO L377 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-23 20:46:24,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:24,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,345 INFO L377 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-23 20:46:24,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,370 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-23 20:46:24,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-11-23 20:46:24,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,497 INFO L377 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-23 20:46:24,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,525 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-23 20:46:24,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-23 20:46:24,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 217 [2019-11-23 20:46:24,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,801 INFO L567 ElimStorePlain]: treesize reduction 98, result has 56.3 percent of original size [2019-11-23 20:46:24,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,836 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-23 20:46:24,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:126 [2019-11-23 20:46:24,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:28,762 WARN L192 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-11-23 20:46:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-23 20:46:29,473 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 139 [2019-11-23 20:46:29,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:29,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:29,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2019-11-23 20:46:29,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050223436] [2019-11-23 20:46:29,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:46:29,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:46:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:46:29,566 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 27 states. [2019-11-23 20:46:33,776 WARN L192 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-23 20:46:34,592 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 147 [2019-11-23 20:46:35,330 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 149 [2019-11-23 20:46:35,855 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-23 20:46:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:38,398 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-11-23 20:46:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-23 20:46:38,399 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-11-23 20:46:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:38,403 INFO L225 Difference]: With dead ends: 183 [2019-11-23 20:46:38,403 INFO L226 Difference]: Without dead ends: 154 [2019-11-23 20:46:38,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=535, Invalid=2545, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 20:46:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-23 20:46:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 38. [2019-11-23 20:46:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 20:46:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-23 20:46:38,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 29 [2019-11-23 20:46:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:38,417 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-23 20:46:38,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:46:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-23 20:46:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:46:38,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:38,419 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:38,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:38,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 235202384, now seen corresponding path program 1 times [2019-11-23 20:46:38,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:38,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144781692] [2019-11-23 20:46:38,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:38,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144781692] [2019-11-23 20:46:38,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542551974] [2019-11-23 20:46:38,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:46:38,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:39,042 INFO L377 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-23 20:46:39,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:39,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,118 INFO L377 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-23 20:46:39,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:39,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,230 INFO L377 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-23 20:46:39,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,249 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-23 20:46:39,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-11-23 20:46:39,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:39,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,396 INFO L377 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 50 treesize of output 55 [2019-11-23 20:46:39,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:39,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:39,421 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-23 20:46:39,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:65 [2019-11-23 20:46:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:39,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:39,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-11-23 20:46:39,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625943624] [2019-11-23 20:46:39,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:46:39,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:46:39,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:46:39,692 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 29 states. [2019-11-23 20:46:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:40,814 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2019-11-23 20:46:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:46:40,816 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-11-23 20:46:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:40,817 INFO L225 Difference]: With dead ends: 188 [2019-11-23 20:46:40,817 INFO L226 Difference]: Without dead ends: 157 [2019-11-23 20:46:40,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 20:46:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-23 20:46:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 64. [2019-11-23 20:46:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 20:46:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2019-11-23 20:46:40,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 35 [2019-11-23 20:46:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:40,848 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2019-11-23 20:46:40,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:46:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2019-11-23 20:46:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:40,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:40,853 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:41,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:41,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1620427075, now seen corresponding path program 2 times [2019-11-23 20:46:41,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:41,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131671377] [2019-11-23 20:46:41,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:41,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131671377] [2019-11-23 20:46:41,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167126055] [2019-11-23 20:46:41,327 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 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-23 20:46:41,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:41,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:41,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:46:41,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:41,493 INFO L377 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-23 20:46:41,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:41,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:41,567 INFO L377 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-23 20:46:41,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:41,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:41,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:41,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:41,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,674 INFO L377 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 38 treesize of output 40 [2019-11-23 20:46:41,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,691 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-23 20:46:41,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-11-23 20:46:41,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:41,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:41,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2019-11-23 20:46:41,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973672176] [2019-11-23 20:46:41,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 20:46:41,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 20:46:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:46:41,929 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 30 states. [2019-11-23 20:46:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:43,388 INFO L93 Difference]: Finished difference Result 215 states and 263 transitions. [2019-11-23 20:46:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 20:46:43,389 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2019-11-23 20:46:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:43,390 INFO L225 Difference]: With dead ends: 215 [2019-11-23 20:46:43,390 INFO L226 Difference]: Without dead ends: 161 [2019-11-23 20:46:43,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=560, Invalid=2410, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 20:46:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-23 20:46:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 90. [2019-11-23 20:46:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 20:46:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-23 20:46:43,413 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 41 [2019-11-23 20:46:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:43,414 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-23 20:46:43,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 20:46:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-23 20:46:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:46:43,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:43,416 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:43,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:43,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:43,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:43,626 INFO L82 PathProgramCache]: Analyzing trace with hash -437643018, now seen corresponding path program 3 times [2019-11-23 20:46:43,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:43,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450467777] [2019-11-23 20:46:43,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:43,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450467777] [2019-11-23 20:46:43,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516418093] [2019-11-23 20:46:43,924 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 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-23 20:46:43,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:46:43,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:43,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:46:43,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:44,026 INFO L377 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-23 20:46:44,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:46:44,123 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:44,123 INFO L377 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-23 20:46:44,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 20:46:44,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:46:44,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:44,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2019-11-23 20:46:44,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735312171] [2019-11-23 20:46:44,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:46:44,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:46:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:46:44,473 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 29 states. [2019-11-23 20:46:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:46,866 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2019-11-23 20:46:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-23 20:46:46,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2019-11-23 20:46:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:46,868 INFO L225 Difference]: With dead ends: 352 [2019-11-23 20:46:46,868 INFO L226 Difference]: Without dead ends: 283 [2019-11-23 20:46:46,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=756, Invalid=4074, Unknown=0, NotChecked=0, Total=4830 [2019-11-23 20:46:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-23 20:46:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 115. [2019-11-23 20:46:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-23 20:46:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2019-11-23 20:46:46,895 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 47 [2019-11-23 20:46:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:46,895 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2019-11-23 20:46:46,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:46:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2019-11-23 20:46:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:46:46,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:46,898 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:47,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:47,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1465687657, now seen corresponding path program 4 times [2019-11-23 20:46:47,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:47,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283224921] [2019-11-23 20:46:47,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:47,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283224921] [2019-11-23 20:46:47,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53075792] [2019-11-23 20:46:47,348 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 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-23 20:46:47,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:46:47,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:47,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:46:47,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:47,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:47,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:47,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:47,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:47,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-23 20:46:47,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:47,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:47,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2019-11-23 20:46:47,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045235189] [2019-11-23 20:46:47,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:46:47,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:46:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:46:47,745 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand 33 states. [2019-11-23 20:46:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:49,266 INFO L93 Difference]: Finished difference Result 253 states and 303 transitions. [2019-11-23 20:46:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-23 20:46:49,267 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2019-11-23 20:46:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:49,269 INFO L225 Difference]: With dead ends: 253 [2019-11-23 20:46:49,269 INFO L226 Difference]: Without dead ends: 251 [2019-11-23 20:46:49,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=713, Invalid=4257, Unknown=0, NotChecked=0, Total=4970 [2019-11-23 20:46:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-23 20:46:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 135. [2019-11-23 20:46:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-23 20:46:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2019-11-23 20:46:49,296 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 53 [2019-11-23 20:46:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:49,297 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2019-11-23 20:46:49,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:46:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2019-11-23 20:46:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 20:46:49,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:49,299 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:49,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:49,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1978865977, now seen corresponding path program 5 times [2019-11-23 20:46:49,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:49,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097099381] [2019-11-23 20:46:49,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 3 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:50,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097099381] [2019-11-23 20:46:50,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488754255] [2019-11-23 20:46:50,329 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 20:46:50,398 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-23 20:46:50,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:50,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:46:50,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:50,524 INFO L377 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-23 20:46:50,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:50,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,611 INFO L377 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-23 20:46:50,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:50,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,741 INFO L377 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-23 20:46:50,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,760 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-23 20:46:50,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2019-11-23 20:46:50,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,965 INFO L377 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-23 20:46:50,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,991 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-23 20:46:50,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-23 20:46:51,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:51,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:51,380 INFO L377 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-23 20:46:51,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:51,512 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-23 20:46:51,513 INFO L567 ElimStorePlain]: treesize reduction 87, result has 60.5 percent of original size [2019-11-23 20:46:51,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,518 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-23 20:46:51,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:133 [2019-11-23 20:46:51,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:51,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:20,375 WARN L192 SmtUtils]: Spent 28.49 s on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-11-23 20:47:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:47:20,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,762 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-23 20:47:20,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:20,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 206 [2019-11-23 20:47:20,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:20,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,961 INFO L377 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 0 case distinctions, treesize of input 108 treesize of output 116 [2019-11-23 20:47:20,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:20,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:20,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:21,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 161 [2019-11-23 20:47:21,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:21,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:21,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:21,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 314 [2019-11-23 20:47:21,270 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:21,820 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 146 [2019-11-23 20:47:21,822 INFO L567 ElimStorePlain]: treesize reduction 270, result has 65.4 percent of original size [2019-11-23 20:47:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 4 xjuncts. [2019-11-23 20:47:21,830 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:433, output treesize:510 [2019-11-23 20:47:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,643 WARN L192 SmtUtils]: Spent 32.34 s on a formula simplification that was a NOOP. DAG size: 171 [2019-11-23 20:47:54,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:47:54,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms