/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/nr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:46:13,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:13,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:13,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:13,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:13,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:13,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:13,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:13,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:13,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:13,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:13,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:13,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:13,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:13,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:13,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:13,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:13,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:13,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:13,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:13,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:13,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:13,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:13,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:13,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:13,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:13,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:13,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:13,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:13,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:13,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:13,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:13,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:13,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:13,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:13,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:13,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:13,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:13,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:13,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:13,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:13,558 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:13,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:13,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:13,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:13,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:13,573 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:13,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:13,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:13,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:13,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:13,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:13,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:13,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:13,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:13,575 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:13,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:13,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:13,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:13,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:13,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:13,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:13,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:13,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:13,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:13,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:13,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:13,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:13,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:13,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:13,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:13,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:13,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:13,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:13,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:13,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:13,886 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:13,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4.c [2019-11-23 20:46:13,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777dd82c0/e1ef963aca5d43bfb8557300a48fb5dc/FLAG0426babe6 [2019-11-23 20:46:14,425 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:14,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c [2019-11-23 20:46:14,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777dd82c0/e1ef963aca5d43bfb8557300a48fb5dc/FLAG0426babe6 [2019-11-23 20:46:14,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777dd82c0/e1ef963aca5d43bfb8557300a48fb5dc [2019-11-23 20:46:14,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:14,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:14,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:14,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:14,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:14,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:14" (1/1) ... [2019-11-23 20:46:14,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c7a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:14, skipping insertion in model container [2019-11-23 20:46:14,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:14" (1/1) ... [2019-11-23 20:46:14,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:14,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:15,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:15,028 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:15,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:15,066 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:15,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:15 WrapperNode [2019-11-23 20:46:15,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:15,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:15,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:15,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:15,074 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:15" (1/1) ... [2019-11-23 20:46:15,165 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:15" (1/1) ... [2019-11-23 20:46:15,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:15,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:15,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:15,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:15,196 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:15" (1/1) ... [2019-11-23 20:46:15,196 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:15" (1/1) ... [2019-11-23 20:46:15,198 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:15" (1/1) ... [2019-11-23 20:46:15,198 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:15" (1/1) ... [2019-11-23 20:46:15,204 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:15" (1/1) ... [2019-11-23 20:46:15,209 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:15" (1/1) ... [2019-11-23 20:46:15,210 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:15" (1/1) ... [2019-11-23 20:46:15,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:15,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:15,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:15,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:15,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:15" (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:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:15,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:46:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:46:15,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:15,565 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 20:46:15,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:15 BoogieIcfgContainer [2019-11-23 20:46:15,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:15,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:15,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:15,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:15,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:14" (1/3) ... [2019-11-23 20:46:15,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c67a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:15, skipping insertion in model container [2019-11-23 20:46:15,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:15" (2/3) ... [2019-11-23 20:46:15,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c67a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:15, skipping insertion in model container [2019-11-23 20:46:15,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:15" (3/3) ... [2019-11-23 20:46:15,575 INFO L109 eAbstractionObserver]: Analyzing ICFG nr4.c [2019-11-23 20:46:15,585 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:15,591 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:15,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:15,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:15,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:15,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:15,629 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:15,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:15,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:15,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:15,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-23 20:46:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:15,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:15,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:15,654 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2072761718, now seen corresponding path program 1 times [2019-11-23 20:46:15,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:15,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385755626] [2019-11-23 20:46:15,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:15,880 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:15,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385755626] [2019-11-23 20:46:15,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:15,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246939293] [2019-11-23 20:46:15,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:15,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:15,915 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-11-23 20:46:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:16,047 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-11-23 20:46:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:16,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:16,065 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:16,065 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:16,071 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:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-11-23 20:46:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 20:46:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-23 20:46:16,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2019-11-23 20:46:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:16,122 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-23 20:46:16,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-23 20:46:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:16,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:16,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:16,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2072821300, now seen corresponding path program 1 times [2019-11-23 20:46:16,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:16,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627804599] [2019-11-23 20:46:16,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,333 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:16,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627804599] [2019-11-23 20:46:16,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:16,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:16,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323670834] [2019-11-23 20:46:16,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:16,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:16,337 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-11-23 20:46:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:16,388 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-23 20:46:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:16,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:16,390 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:46:16,390 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:16,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-23 20:46:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:46:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 20:46:16,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 20:46:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:16,398 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 20:46:16,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 20:46:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:46:16,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:16,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:16,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash -594620155, now seen corresponding path program 1 times [2019-11-23 20:46:16,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:16,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755878789] [2019-11-23 20:46:16,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,466 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:16,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755878789] [2019-11-23 20:46:16,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:16,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:46:16,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255709411] [2019-11-23 20:46:16,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:46:16,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:46:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:16,469 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-23 20:46:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:16,505 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-23 20:46:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:46:16,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 20:46:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:16,507 INFO L225 Difference]: With dead ends: 40 [2019-11-23 20:46:16,507 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 20:46:16,508 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:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 20:46:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-23 20:46:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:46:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:46:16,513 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-23 20:46:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:16,513 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:46:16,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:46:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:46:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:46:16,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:16,515 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:16,515 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2056923621, now seen corresponding path program 1 times [2019-11-23 20:46:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991337378] [2019-11-23 20:46:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,565 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:16,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991337378] [2019-11-23 20:46:16,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468996337] [2019-11-23 20:46:16,568 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:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:46:16,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:16,674 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:16,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:16,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 20:46:16,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203271656] [2019-11-23 20:46:16,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:16,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:16,679 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-23 20:46:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:16,723 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-11-23 20:46:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:16,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 20:46:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:16,725 INFO L225 Difference]: With dead ends: 44 [2019-11-23 20:46:16,725 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:46:16,725 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:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:46:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-23 20:46:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-23 20:46:16,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2019-11-23 20:46:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:16,731 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-23 20:46:16,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-23 20:46:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:16,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:16,733 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:16,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:16,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1686195899, now seen corresponding path program 2 times [2019-11-23 20:46:16,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:16,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463825166] [2019-11-23 20:46:16,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:17,042 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:17,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463825166] [2019-11-23 20:46:17,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485674549] [2019-11-23 20:46:17,044 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:17,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:17,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:17,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:46:17,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:17,104 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:17,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:17,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-23 20:46:17,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727662969] [2019-11-23 20:46:17,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:46:17,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:17,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:46:17,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:17,107 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-11-23 20:46:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:17,157 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-23 20:46:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:17,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-23 20:46:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:17,159 INFO L225 Difference]: With dead ends: 50 [2019-11-23 20:46:17,159 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 20:46:17,160 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:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 20:46:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-23 20:46:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:46:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-23 20:46:17,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 20 [2019-11-23 20:46:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:17,166 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-23 20:46:17,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:46:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-23 20:46:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:17,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:17,167 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:17,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:17,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 302452187, now seen corresponding path program 3 times [2019-11-23 20:46:17,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:17,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059599729] [2019-11-23 20:46:17,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:17,449 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:17,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059599729] [2019-11-23 20:46:17,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401455896] [2019-11-23 20:46:17,449 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:17,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:46:17,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:17,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:46:17,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:17,530 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:17,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:17,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-23 20:46:17,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030015553] [2019-11-23 20:46:17,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:46:17,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:46:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:46:17,533 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 7 states. [2019-11-23 20:46:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:17,646 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-11-23 20:46:17,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:46:17,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-23 20:46:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:17,650 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:17,650 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 20:46:17,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:46:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 20:46:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-23 20:46:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 20:46:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-23 20:46:17,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 23 [2019-11-23 20:46:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:17,666 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-23 20:46:17,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:46:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-23 20:46:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 20:46:17,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:17,668 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:17,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:17,869 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 39765767, now seen corresponding path program 1 times [2019-11-23 20:46:17,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:17,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091392347] [2019-11-23 20:46:17,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:18,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091392347] [2019-11-23 20:46:18,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220604750] [2019-11-23 20:46:18,484 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:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:18,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:46:18,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:18,598 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:18,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-23 20:46:18,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,682 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 49 treesize of output 48 [2019-11-23 20:46:18,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-23 20:46:18,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,808 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 63 treesize of output 65 [2019-11-23 20:46:18,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:18,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,833 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:18,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:96 [2019-11-23 20:46:18,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:18,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:18,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 211 [2019-11-23 20:46:18,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:19,040 INFO L567 ElimStorePlain]: treesize reduction 93, result has 59.9 percent of original size [2019-11-23 20:46:19,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,056 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:19,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:95, output treesize:139 [2019-11-23 20:46:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:19,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:23,543 WARN L192 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-23 20:46:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:46:24,292 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 97 [2019-11-23 20:46:24,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:24,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:24,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2019-11-23 20:46:24,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148200827] [2019-11-23 20:46:24,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:46:24,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:24,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:46:24,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:46:24,397 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 23 states. [2019-11-23 20:46:26,840 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-11-23 20:46:29,342 WARN L192 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2019-11-23 20:46:29,867 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 108 [2019-11-23 20:46:32,298 WARN L192 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-23 20:46:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:33,201 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2019-11-23 20:46:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 20:46:33,201 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-23 20:46:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:33,206 INFO L225 Difference]: With dead ends: 168 [2019-11-23 20:46:33,206 INFO L226 Difference]: Without dead ends: 142 [2019-11-23 20:46:33,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=459, Invalid=1991, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 20:46:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-23 20:46:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 49. [2019-11-23 20:46:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:46:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-11-23 20:46:33,221 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2019-11-23 20:46:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:33,221 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-11-23 20:46:33,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:46:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-11-23 20:46:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:46:33,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:33,222 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:33,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:33,424 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1281407930, now seen corresponding path program 1 times [2019-11-23 20:46:33,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:33,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201059928] [2019-11-23 20:46:33,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:33,854 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2019-11-23 20:46:34,021 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-11-23 20:46:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:34,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201059928] [2019-11-23 20:46:34,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624423771] [2019-11-23 20:46:34,705 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:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:34,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:46:34,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:34,856 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:34,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:34,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:34,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:34,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:34,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:34,938 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:34,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:34,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:34,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:34,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:35,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,054 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:35,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,069 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:35,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-11-23 20:46:35,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:35,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:35,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-11-23 20:46:35,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557237805] [2019-11-23 20:46:35,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:46:35,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:46:35,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:46:35,268 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 28 states. [2019-11-23 20:46:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:38,016 INFO L93 Difference]: Finished difference Result 181 states and 220 transitions. [2019-11-23 20:46:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:46:38,017 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-11-23 20:46:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:38,018 INFO L225 Difference]: With dead ends: 181 [2019-11-23 20:46:38,019 INFO L226 Difference]: Without dead ends: 142 [2019-11-23 20:46:38,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=559, Invalid=2633, Unknown=0, NotChecked=0, Total=3192 [2019-11-23 20:46:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-23 20:46:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 55. [2019-11-23 20:46:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:46:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-23 20:46:38,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 32 [2019-11-23 20:46:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:38,032 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-23 20:46:38,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:46:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-23 20:46:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 20:46:38,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:38,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:38,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:38,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1089003987, now seen corresponding path program 2 times [2019-11-23 20:46:38,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:38,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760596207] [2019-11-23 20:46:38,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:38,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760596207] [2019-11-23 20:46:38,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788588944] [2019-11-23 20:46:38,511 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:38,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:38,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:38,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:46:38,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:38,687 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 16 treesize of output 12 [2019-11-23 20:46:38,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:38,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:38,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:38,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:46:38,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:38,743 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 26 treesize of output 57 [2019-11-23 20:46:38,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:38,771 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-11-23 20:46:38,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,773 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:38,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:39 [2019-11-23 20:46:38,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:39,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:39,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-11-23 20:46:39,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438660025] [2019-11-23 20:46:39,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:46:39,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:46:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:46:39,274 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 27 states. [2019-11-23 20:46:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:43,209 INFO L93 Difference]: Finished difference Result 269 states and 327 transitions. [2019-11-23 20:46:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-23 20:46:43,209 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-11-23 20:46:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:43,212 INFO L225 Difference]: With dead ends: 269 [2019-11-23 20:46:43,212 INFO L226 Difference]: Without dead ends: 227 [2019-11-23 20:46:43,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=832, Invalid=5020, Unknown=0, NotChecked=0, Total=5852 [2019-11-23 20:46:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-23 20:46:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 123. [2019-11-23 20:46:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-23 20:46:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2019-11-23 20:46:43,237 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 38 [2019-11-23 20:46:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:43,237 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2019-11-23 20:46:43,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:46:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2019-11-23 20:46:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:43,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:43,239 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:43,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:43,442 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash 930454996, now seen corresponding path program 2 times [2019-11-23 20:46:43,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:43,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53344936] [2019-11-23 20:46:43,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:44,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53344936] [2019-11-23 20:46:44,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905379376] [2019-11-23 20:46:44,393 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 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:44,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:44,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:44,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 20:46:44,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:44,453 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,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,465 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,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-23 20:46:44,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,529 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 49 treesize of output 48 [2019-11-23 20:46:44,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,548 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,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-23 20:46:44,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,671 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 63 treesize of output 65 [2019-11-23 20:46:44,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,693 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:44,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:100, output treesize:96 [2019-11-23 20:46:44,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:44,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,850 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 77 treesize of output 82 [2019-11-23 20:46:44,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,880 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:44,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:119, output treesize:115 [2019-11-23 20:46:45,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:45,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:45,140 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 79 treesize of output 222 [2019-11-23 20:46:45,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:45,256 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-23 20:46:45,257 INFO L567 ElimStorePlain]: treesize reduction 87, result has 65.3 percent of original size [2019-11-23 20:46:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,263 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:45,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:120, output treesize:164 [2019-11-23 20:46:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:14,907 WARN L192 SmtUtils]: Spent 29.39 s on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-11-23 20:47:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:47:15,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,202 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 139 treesize of output 147 [2019-11-23 20:47:15,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:15,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:15,334 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 139 treesize of output 237 [2019-11-23 20:47:15,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:15,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:15,550 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 139 treesize of output 345 [2019-11-23 20:47:15,552 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:15,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:15,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:15,608 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 139 treesize of output 192 [2019-11-23 20:47:15,609 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:16,145 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 154 [2019-11-23 20:47:16,146 INFO L567 ElimStorePlain]: treesize reduction 245, result has 71.9 percent of original size [2019-11-23 20:47:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,159 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:16,159 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:557, output treesize:626 [2019-11-23 20:47:16,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:16,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,013 WARN L192 SmtUtils]: Spent 32.66 s on a formula simplification that was a NOOP. DAG size: 179 [2019-11-23 20:47:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 20:47:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms