/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/pnr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:46:30,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:30,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:30,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:30,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:30,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:30,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:30,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:30,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:30,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:30,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:30,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:30,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:30,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:30,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:30,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:30,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:30,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:30,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:30,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:30,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:30,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:30,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:30,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:30,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:30,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:30,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:30,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:30,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:30,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:30,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:30,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:30,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:30,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:30,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:30,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:30,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:30,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:30,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:30,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:30,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:30,347 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:30,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:30,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:30,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:30,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:30,371 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:30,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:30,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:30,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:30,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:30,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:30,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:30,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:30,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:30,374 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:30,374 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:30,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:30,375 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:30,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:30,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:30,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:30,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:30,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:30,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:30,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:30,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:30,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:30,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:30,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:30,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:30,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:30,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:30,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:30,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:30,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:30,692 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:30,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2.c [2019-11-23 20:46:30,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb1ac46/3caab654af58430baeca42c79fc15250/FLAG397342817 [2019-11-23 20:46:31,222 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:31,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2.c [2019-11-23 20:46:31,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb1ac46/3caab654af58430baeca42c79fc15250/FLAG397342817 [2019-11-23 20:46:31,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb1ac46/3caab654af58430baeca42c79fc15250 [2019-11-23 20:46:31,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:31,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:31,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:31,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:31,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:31,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:31" (1/1) ... [2019-11-23 20:46:31,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b57d1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:31, skipping insertion in model container [2019-11-23 20:46:31,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:31" (1/1) ... [2019-11-23 20:46:31,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:31,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:31,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:31,865 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:31,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:31,903 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:31,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:31 WrapperNode [2019-11-23 20:46:31,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:31,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:31,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:31,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:31,914 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:31" (1/1) ... [2019-11-23 20:46:32,010 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:31" (1/1) ... [2019-11-23 20:46:32,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:32,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:32,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:32,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:32,042 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:31" (1/1) ... [2019-11-23 20:46:32,042 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:31" (1/1) ... [2019-11-23 20:46:32,044 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:31" (1/1) ... [2019-11-23 20:46:32,044 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:31" (1/1) ... [2019-11-23 20:46:32,050 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:31" (1/1) ... [2019-11-23 20:46:32,055 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:31" (1/1) ... [2019-11-23 20:46:32,057 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:31" (1/1) ... [2019-11-23 20:46:32,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:32,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:32,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:32,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:32,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:31" (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:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:46:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:32,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:32,355 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:32,355 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-23 20:46:32,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:32 BoogieIcfgContainer [2019-11-23 20:46:32,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:32,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:32,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:32,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:32,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:31" (1/3) ... [2019-11-23 20:46:32,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd2616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:32, skipping insertion in model container [2019-11-23 20:46:32,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:31" (2/3) ... [2019-11-23 20:46:32,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd2616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:32, skipping insertion in model container [2019-11-23 20:46:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:32" (3/3) ... [2019-11-23 20:46:32,365 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr2.c [2019-11-23 20:46:32,378 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:32,388 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:32,402 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:32,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:32,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:32,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:32,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:32,433 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:32,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:32,433 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:32,433 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-23 20:46:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:46:32,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:32,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:32,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash -561001774, now seen corresponding path program 1 times [2019-11-23 20:46:32,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366730634] [2019-11-23 20:46:32,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:32,702 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:32,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366730634] [2019-11-23 20:46:32,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:32,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:32,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285970775] [2019-11-23 20:46:32,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:32,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:32,721 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-11-23 20:46:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:32,826 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-11-23 20:46:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:32,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-23 20:46:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:32,839 INFO L225 Difference]: With dead ends: 44 [2019-11-23 20:46:32,840 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:32,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-11-23 20:46:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 20:46:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-23 20:46:32,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-11-23 20:46:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:32,885 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-23 20:46:32,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-23 20:46:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:46:32,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:32,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:32,887 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash 548188039, now seen corresponding path program 1 times [2019-11-23 20:46:32,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:32,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760134595] [2019-11-23 20:46:32,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:33,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760134595] [2019-11-23 20:46:33,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019141195] [2019-11-23 20:46:33,543 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:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:33,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:46:33,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:33,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:33,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:33,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:33,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:46:33,761 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:46:33,761 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 22 treesize of output 21 [2019-11-23 20:46:33,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:33,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:33,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:33,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-11-23 20:46:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:33,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:33,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-23 20:46:33,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173610003] [2019-11-23 20:46:33,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:46:33,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:46:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:46:33,824 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 14 states. [2019-11-23 20:46:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:34,233 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-11-23 20:46:34,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:46:34,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-23 20:46:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:34,236 INFO L225 Difference]: With dead ends: 56 [2019-11-23 20:46:34,236 INFO L226 Difference]: Without dead ends: 54 [2019-11-23 20:46:34,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:46:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-23 20:46:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2019-11-23 20:46:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:46:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-23 20:46:34,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 16 [2019-11-23 20:46:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:34,253 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-23 20:46:34,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:46:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-23 20:46:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:46:34,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:34,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:34,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:34,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash 155161029, now seen corresponding path program 1 times [2019-11-23 20:46:34,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:34,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472682746] [2019-11-23 20:46:34,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:35,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472682746] [2019-11-23 20:46:35,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494526854] [2019-11-23 20:46:35,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:35,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:46:35,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:35,282 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:35,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:35,349 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:46:35,350 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 21 treesize of output 20 [2019-11-23 20:46:35,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:46:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:35,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:35,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:46:35,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580477773] [2019-11-23 20:46:35,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:46:35,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:46:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:46:35,422 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2019-11-23 20:46:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:36,457 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2019-11-23 20:46:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:46:36,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-23 20:46:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:36,460 INFO L225 Difference]: With dead ends: 75 [2019-11-23 20:46:36,460 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 20:46:36,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:46:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 20:46:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 21. [2019-11-23 20:46:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:46:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-23 20:46:36,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2019-11-23 20:46:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:36,469 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-23 20:46:36,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:46:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-23 20:46:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:36,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:36,470 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:36,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:36,681 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1659484803, now seen corresponding path program 1 times [2019-11-23 20:46:36,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:36,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428210489] [2019-11-23 20:46:36,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:37,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428210489] [2019-11-23 20:46:37,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729844971] [2019-11-23 20:46:37,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:37,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:46:37,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:37,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:37,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:37,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:37,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:37,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-11-23 20:46:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:37,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:37,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-23 20:46:37,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640738306] [2019-11-23 20:46:37,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:46:37,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:46:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:46:37,215 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 15 states. [2019-11-23 20:46:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:37,702 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-23 20:46:37,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:46:37,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-11-23 20:46:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:37,704 INFO L225 Difference]: With dead ends: 61 [2019-11-23 20:46:37,704 INFO L226 Difference]: Without dead ends: 59 [2019-11-23 20:46:37,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:46:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-23 20:46:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-11-23 20:46:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:46:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-23 20:46:37,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2019-11-23 20:46:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:37,715 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-23 20:46:37,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:46:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-11-23 20:46:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:37,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:37,716 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:37,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:37,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -958420225, now seen corresponding path program 1 times [2019-11-23 20:46:37,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:37,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608517302] [2019-11-23 20:46:37,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:38,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608517302] [2019-11-23 20:46:38,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391482811] [2019-11-23 20:46:38,375 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:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:38,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:46:38,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:38,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:38,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:38,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:38,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:38,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:46:38,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:38,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:38,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 20:46:38,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940542199] [2019-11-23 20:46:38,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:46:38,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:46:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:46:38,544 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 16 states. [2019-11-23 20:46:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:39,823 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-23 20:46:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:46:39,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-11-23 20:46:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:39,825 INFO L225 Difference]: With dead ends: 88 [2019-11-23 20:46:39,825 INFO L226 Difference]: Without dead ends: 86 [2019-11-23 20:46:39,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=1053, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:46:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-23 20:46:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 25. [2019-11-23 20:46:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-23 20:46:39,832 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-11-23 20:46:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:39,833 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-23 20:46:39,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:46:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-23 20:46:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:46:39,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:39,834 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:40,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:40,037 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -29888397, now seen corresponding path program 2 times [2019-11-23 20:46:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:40,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276739540] [2019-11-23 20:46:40,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:40,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276739540] [2019-11-23 20:46:40,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199889283] [2019-11-23 20:46:40,313 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 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:40,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:40,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:40,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:46:40,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:40,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:46:40,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:40,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:40,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:40,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-23 20:46:40,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907479660] [2019-11-23 20:46:40,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:46:40,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:46:40,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:46:40,513 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 15 states. [2019-11-23 20:46:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:40,718 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-23 20:46:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 20:46:40,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-23 20:46:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:40,719 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:40,719 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 20:46:40,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:46:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 20:46:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-23 20:46:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 20:46:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-23 20:46:40,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 24 [2019-11-23 20:46:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:40,727 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-23 20:46:40,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:46:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-23 20:46:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:46:40,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:40,728 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:40,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:40,939 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 643328798, now seen corresponding path program 3 times [2019-11-23 20:46:40,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:40,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680504851] [2019-11-23 20:46:40,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680504851] [2019-11-23 20:46:41,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070348713] [2019-11-23 20:46:41,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:41,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:46:41,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:41,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:46:41,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:41,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:41,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:46:41,188 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:46:41,188 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 30 treesize of output 29 [2019-11-23 20:46:41,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:41,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:41,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:41,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-11-23 20:46:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:41,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:41,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-23 20:46:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254203019] [2019-11-23 20:46:41,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:46:41,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:46:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:46:41,269 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2019-11-23 20:46:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:41,618 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2019-11-23 20:46:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:46:41,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-23 20:46:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:41,620 INFO L225 Difference]: With dead ends: 90 [2019-11-23 20:46:41,620 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 20:46:41,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:46:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 20:46:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 44. [2019-11-23 20:46:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:46:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-23 20:46:41,633 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 31 [2019-11-23 20:46:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:41,633 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-23 20:46:41,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:46:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-23 20:46:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:46:41,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:41,636 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:41,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:41,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1350815908, now seen corresponding path program 1 times [2019-11-23 20:46:41,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:41,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054565263] [2019-11-23 20:46:41,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:42,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054565263] [2019-11-23 20:46:42,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778810581] [2019-11-23 20:46:42,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:42,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:46:42,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:42,196 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:42,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:42,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:46:42,241 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:46:42,241 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 23 treesize of output 22 [2019-11-23 20:46:42,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:42,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:42,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:46:42,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:42,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:42,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-11-23 20:46:42,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026165579] [2019-11-23 20:46:42,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:46:42,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:46:42,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:46:42,349 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 19 states. [2019-11-23 20:46:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:43,640 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2019-11-23 20:46:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 20:46:43,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-11-23 20:46:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:43,642 INFO L225 Difference]: With dead ends: 116 [2019-11-23 20:46:43,642 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 20:46:43,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 20:46:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 20:46:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 36. [2019-11-23 20:46:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 20:46:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-23 20:46:43,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2019-11-23 20:46:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:43,661 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-23 20:46:43,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:46:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-23 20:46:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:46:43,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:43,667 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:43,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:43,871 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash 683433364, now seen corresponding path program 4 times [2019-11-23 20:46:43,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:43,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338425441] [2019-11-23 20:46:43,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:44,455 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:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338425441] [2019-11-23 20:46:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047866110] [2019-11-23 20:46:44,456 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:44,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:46:44,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:44,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:46:44,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:44,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:44,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:44,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:44,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-11-23 20:46:44,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:44,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:44,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-23 20:46:44,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310443309] [2019-11-23 20:46:44,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:46:44,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:46:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:46:44,771 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 21 states. [2019-11-23 20:46:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:46,154 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2019-11-23 20:46:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 20:46:46,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-11-23 20:46:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:46,155 INFO L225 Difference]: With dead ends: 110 [2019-11-23 20:46:46,156 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 20:46:46,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=401, Invalid=2149, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 20:46:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 20:46:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2019-11-23 20:46:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 20:46:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-11-23 20:46:46,177 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 35 [2019-11-23 20:46:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:46,177 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-11-23 20:46:46,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:46:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-11-23 20:46:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:46:46,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:46,181 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:46,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:46,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1005510378, now seen corresponding path program 1 times [2019-11-23 20:46:46,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:46,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607011895] [2019-11-23 20:46:46,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:46,997 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:46,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607011895] [2019-11-23 20:46:46,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551766281] [2019-11-23 20:46:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:47,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:46:47,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:47,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:46:47,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:47,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:47,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:47,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:46:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:47,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:47,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-23 20:46:47,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119516804] [2019-11-23 20:46:47,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:46:47,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:46:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:46:47,252 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 22 states. [2019-11-23 20:46:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:49,432 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-11-23 20:46:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 20:46:49,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-11-23 20:46:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:49,435 INFO L225 Difference]: With dead ends: 124 [2019-11-23 20:46:49,435 INFO L226 Difference]: Without dead ends: 101 [2019-11-23 20:46:49,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=476, Invalid=2386, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 20:46:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-23 20:46:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-11-23 20:46:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-23 20:46:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-11-23 20:46:49,448 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 35 [2019-11-23 20:46:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:49,449 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-11-23 20:46:49,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:46:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-11-23 20:46:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 20:46:49,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:49,450 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:49,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:49,654 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1583455999, now seen corresponding path program 5 times [2019-11-23 20:46:49,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:49,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807931185] [2019-11-23 20:46:49,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:49,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807931185] [2019-11-23 20:46:49,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133743093] [2019-11-23 20:46:49,838 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:49,916 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:46:49,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:49,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:46:49,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:50,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:50,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:46:50,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:50,059 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 24 treesize of output 23 [2019-11-23 20:46:50,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:50,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:50,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-11-23 20:46:50,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:50,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:50,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-23 20:46:50,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126102221] [2019-11-23 20:46:50,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:46:50,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:50,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:46:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:46:50,212 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 24 states. [2019-11-23 20:46:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:51,601 INFO L93 Difference]: Finished difference Result 378 states and 486 transitions. [2019-11-23 20:46:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:46:51,601 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-11-23 20:46:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:51,603 INFO L225 Difference]: With dead ends: 378 [2019-11-23 20:46:51,603 INFO L226 Difference]: Without dead ends: 376 [2019-11-23 20:46:51,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=2935, Unknown=0, NotChecked=0, Total=3422 [2019-11-23 20:46:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-23 20:46:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 129. [2019-11-23 20:46:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-23 20:46:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2019-11-23 20:46:51,627 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 46 [2019-11-23 20:46:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:51,628 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2019-11-23 20:46:51,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:46:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2019-11-23 20:46:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 20:46:51,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:51,629 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:51,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:51,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1645495613, now seen corresponding path program 2 times [2019-11-23 20:46:51,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:51,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209501497] [2019-11-23 20:46:51,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:52,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209501497] [2019-11-23 20:46:52,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586646876] [2019-11-23 20:46:52,041 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:52,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:52,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:52,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:46:52,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:52,178 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:52,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:52,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:46:52,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:52,228 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 23 treesize of output 22 [2019-11-23 20:46:52,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:52,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:52,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:46:52,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:52,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:52,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-23 20:46:52,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511521506] [2019-11-23 20:46:52,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:46:52,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:46:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:46:52,396 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 25 states. [2019-11-23 20:46:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:55,131 INFO L93 Difference]: Finished difference Result 412 states and 520 transitions. [2019-11-23 20:46:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-23 20:46:55,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-11-23 20:46:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:55,135 INFO L225 Difference]: With dead ends: 412 [2019-11-23 20:46:55,135 INFO L226 Difference]: Without dead ends: 410 [2019-11-23 20:46:55,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=694, Invalid=4276, Unknown=0, NotChecked=0, Total=4970 [2019-11-23 20:46:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-23 20:46:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 92. [2019-11-23 20:46:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 20:46:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-11-23 20:46:55,153 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 46 [2019-11-23 20:46:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:55,154 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-11-23 20:46:55,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:46:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-11-23 20:46:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:46:55,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:55,155 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:55,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:55,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash 133112694, now seen corresponding path program 2 times [2019-11-23 20:46:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:55,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308549256] [2019-11-23 20:46:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:55,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308549256] [2019-11-23 20:46:55,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509698188] [2019-11-23 20:46:55,561 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:55,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:55,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:55,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:46:55,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:55,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:55,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:55,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:46:55,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:55,742 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 27 treesize of output 26 [2019-11-23 20:46:55,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:55,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:46:55,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:55,757 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 27 treesize of output 26 [2019-11-23 20:46:55,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:55,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:46:55,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:55,794 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 27 treesize of output 26 [2019-11-23 20:46:55,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:55,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:46:55,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:55,811 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 27 treesize of output 26 [2019-11-23 20:46:55,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:55,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:55,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:14 [2019-11-23 20:46:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:55,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:55,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-23 20:46:55,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444127670] [2019-11-23 20:46:55,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:46:55,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:46:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:46:55,952 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 25 states. [2019-11-23 20:46:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:56,666 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2019-11-23 20:46:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:46:56,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2019-11-23 20:46:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:56,668 INFO L225 Difference]: With dead ends: 188 [2019-11-23 20:46:56,668 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 20:46:56,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:46:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 20:46:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 87. [2019-11-23 20:46:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-23 20:46:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2019-11-23 20:46:56,685 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 49 [2019-11-23 20:46:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:56,685 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2019-11-23 20:46:56,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:46:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2019-11-23 20:46:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:46:56,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:56,686 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:56,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:56,890 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1749669878, now seen corresponding path program 3 times [2019-11-23 20:46:56,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:56,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426815729] [2019-11-23 20:46:56,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:57,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426815729] [2019-11-23 20:46:57,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232117931] [2019-11-23 20:46:57,124 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:57,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:46:57,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:57,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:46:57,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:57,278 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:57,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:57,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:46:57,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:57,349 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 26 treesize of output 25 [2019-11-23 20:46:57,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:57,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:46:57,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:57,366 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 26 treesize of output 25 [2019-11-23 20:46:57,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:57,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:46:57,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:57,417 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 26 treesize of output 25 [2019-11-23 20:46:57,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:57,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:46:57,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:57,432 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 26 treesize of output 25 [2019-11-23 20:46:57,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:57,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:57,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2019-11-23 20:46:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:57,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:57,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-23 20:46:57,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417548918] [2019-11-23 20:46:57,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:46:57,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:46:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:46:57,583 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 26 states. [2019-11-23 20:46:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:59,528 INFO L93 Difference]: Finished difference Result 148 states and 174 transitions. [2019-11-23 20:46:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 20:46:59,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-11-23 20:46:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:59,530 INFO L225 Difference]: With dead ends: 148 [2019-11-23 20:46:59,530 INFO L226 Difference]: Without dead ends: 146 [2019-11-23 20:46:59,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=588, Invalid=3194, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:46:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-23 20:46:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 51. [2019-11-23 20:46:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 20:46:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-11-23 20:46:59,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 49 [2019-11-23 20:46:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:59,541 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-11-23 20:46:59,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:46:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-11-23 20:46:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 20:46:59,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:59,541 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:59,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:59,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash 257341685, now seen corresponding path program 6 times [2019-11-23 20:46:59,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:59,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316673650] [2019-11-23 20:46:59,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:59,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316673650] [2019-11-23 20:46:59,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945282738] [2019-11-23 20:46:59,877 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:59,955 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:46:59,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:59,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:46:59,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:59,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:59,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:59,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:59,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:59,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-23 20:47:00,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:00,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:00,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 19 [2019-11-23 20:47:00,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291936935] [2019-11-23 20:47:00,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:47:00,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:47:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:47:00,103 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 19 states. [2019-11-23 20:47:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:02,275 INFO L93 Difference]: Finished difference Result 357 states and 446 transitions. [2019-11-23 20:47:02,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-23 20:47:02,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2019-11-23 20:47:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:02,277 INFO L225 Difference]: With dead ends: 357 [2019-11-23 20:47:02,277 INFO L226 Difference]: Without dead ends: 355 [2019-11-23 20:47:02,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=6192, Unknown=0, NotChecked=0, Total=6972 [2019-11-23 20:47:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-23 20:47:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 82. [2019-11-23 20:47:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 20:47:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2019-11-23 20:47:02,300 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 50 [2019-11-23 20:47:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:02,301 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-11-23 20:47:02,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:47:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2019-11-23 20:47:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 20:47:02,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:02,302 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:02,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:02,502 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2114397577, now seen corresponding path program 4 times [2019-11-23 20:47:02,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:02,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852836803] [2019-11-23 20:47:02,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:02,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852836803] [2019-11-23 20:47:02,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73755721] [2019-11-23 20:47:02,747 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:02,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:47:02,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:02,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:47:02,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:02,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:02,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:02,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:02,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:02,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:47:03,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:03,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:03,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-11-23 20:47:03,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308279328] [2019-11-23 20:47:03,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:47:03,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:47:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:47:03,072 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 27 states. [2019-11-23 20:47:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:06,577 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2019-11-23 20:47:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-23 20:47:06,577 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-11-23 20:47:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:06,579 INFO L225 Difference]: With dead ends: 246 [2019-11-23 20:47:06,579 INFO L226 Difference]: Without dead ends: 244 [2019-11-23 20:47:06,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1052, Invalid=7138, Unknown=0, NotChecked=0, Total=8190 [2019-11-23 20:47:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-23 20:47:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 55. [2019-11-23 20:47:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 20:47:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-11-23 20:47:06,594 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 50 [2019-11-23 20:47:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:06,594 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-23 20:47:06,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:47:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-11-23 20:47:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 20:47:06,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:06,595 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:06,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:06,797 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1415452693, now seen corresponding path program 7 times [2019-11-23 20:47:06,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:06,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11663945] [2019-11-23 20:47:06,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:07,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11663945] [2019-11-23 20:47:07,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865230585] [2019-11-23 20:47:07,323 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:07,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:47:07,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:07,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:47:07,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:07,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:07,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-11-23 20:47:07,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911359626] [2019-11-23 20:47:07,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:47:07,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:47:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:47:07,713 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 27 states. [2019-11-23 20:47:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:08,068 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-11-23 20:47:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:47:08,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-11-23 20:47:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:08,069 INFO L225 Difference]: With dead ends: 100 [2019-11-23 20:47:08,069 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 20:47:08,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:47:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 20:47:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-11-23 20:47:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 20:47:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-11-23 20:47:08,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 54 [2019-11-23 20:47:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:08,083 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-11-23 20:47:08,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:47:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-11-23 20:47:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:47:08,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:08,083 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:08,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:08,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1028741802, now seen corresponding path program 8 times [2019-11-23 20:47:08,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:08,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454332849] [2019-11-23 20:47:08,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:08,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454332849] [2019-11-23 20:47:08,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784706601] [2019-11-23 20:47:08,503 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:08,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:47:08,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:08,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 20:47:08,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:08,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:47:08,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:08,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:47:08,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:08,710 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 24 treesize of output 23 [2019-11-23 20:47:08,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:08,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:08,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-11-23 20:47:08,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:09,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:09,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-23 20:47:09,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848148694] [2019-11-23 20:47:09,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 20:47:09,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 20:47:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:47:09,029 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 30 states. [2019-11-23 20:47:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:13,877 INFO L93 Difference]: Finished difference Result 657 states and 839 transitions. [2019-11-23 20:47:13,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-11-23 20:47:13,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2019-11-23 20:47:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:13,881 INFO L225 Difference]: With dead ends: 657 [2019-11-23 20:47:13,881 INFO L226 Difference]: Without dead ends: 655 [2019-11-23 20:47:13,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9928 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2467, Invalid=22339, Unknown=0, NotChecked=0, Total=24806 [2019-11-23 20:47:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-23 20:47:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 90. [2019-11-23 20:47:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 20:47:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-11-23 20:47:13,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2019-11-23 20:47:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:13,918 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-11-23 20:47:13,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 20:47:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-11-23 20:47:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:47:13,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:13,919 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:14,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:14,120 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1022242196, now seen corresponding path program 3 times [2019-11-23 20:47:14,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:14,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202756432] [2019-11-23 20:47:14,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:14,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202756432] [2019-11-23 20:47:14,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302740759] [2019-11-23 20:47:14,476 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:14,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:47:14,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:14,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 20:47:14,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:14,720 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:47:14,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:14,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:14,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:14,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:47:14,798 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:47:14,798 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 23 treesize of output 22 [2019-11-23 20:47:14,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:14,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:14,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:14,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:47:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:15,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:15,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-11-23 20:47:15,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987612880] [2019-11-23 20:47:15,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:47:15,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:47:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:47:15,034 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 31 states. [2019-11-23 20:47:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:19,934 INFO L93 Difference]: Finished difference Result 299 states and 361 transitions. [2019-11-23 20:47:19,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-23 20:47:19,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2019-11-23 20:47:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:19,941 INFO L225 Difference]: With dead ends: 299 [2019-11-23 20:47:19,941 INFO L226 Difference]: Without dead ends: 297 [2019-11-23 20:47:19,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3562 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1290, Invalid=10052, Unknown=0, NotChecked=0, Total=11342 [2019-11-23 20:47:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-23 20:47:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 66. [2019-11-23 20:47:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 20:47:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-11-23 20:47:19,962 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 61 [2019-11-23 20:47:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:19,963 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-11-23 20:47:19,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:47:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-11-23 20:47:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:47:19,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:19,964 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:20,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:20,167 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:20,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash -562381876, now seen corresponding path program 9 times [2019-11-23 20:47:20,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:20,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981693292] [2019-11-23 20:47:20,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:21,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981693292] [2019-11-23 20:47:21,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523059103] [2019-11-23 20:47:21,246 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:21,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-23 20:47:21,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:21,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 20:47:21,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:21,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:21,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:21,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:21,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:21,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-11-23 20:47:21,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:21,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:21,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-11-23 20:47:21,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6099417] [2019-11-23 20:47:21,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:47:21,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:47:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:47:21,699 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 33 states. [2019-11-23 20:47:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:24,335 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2019-11-23 20:47:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-23 20:47:24,336 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2019-11-23 20:47:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:24,337 INFO L225 Difference]: With dead ends: 198 [2019-11-23 20:47:24,337 INFO L226 Difference]: Without dead ends: 159 [2019-11-23 20:47:24,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=723, Invalid=6249, Unknown=0, NotChecked=0, Total=6972 [2019-11-23 20:47:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-23 20:47:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2019-11-23 20:47:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 20:47:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2019-11-23 20:47:24,377 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 65 [2019-11-23 20:47:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:24,377 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2019-11-23 20:47:24,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:47:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2019-11-23 20:47:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:47:24,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:24,378 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:24,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:24,581 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1406387378, now seen corresponding path program 5 times [2019-11-23 20:47:24,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:24,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010537882] [2019-11-23 20:47:24,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:25,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010537882] [2019-11-23 20:47:25,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949406642] [2019-11-23 20:47:25,563 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:25,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:47:25,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:25,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 20:47:25,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:25,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:25,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:25,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:25,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:25,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-23 20:47:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:26,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:26,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-23 20:47:26,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955081671] [2019-11-23 20:47:26,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 20:47:26,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 20:47:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:47:26,165 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 34 states. [2019-11-23 20:47:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:30,177 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-11-23 20:47:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-23 20:47:30,177 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-11-23 20:47:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:30,178 INFO L225 Difference]: With dead ends: 215 [2019-11-23 20:47:30,178 INFO L226 Difference]: Without dead ends: 176 [2019-11-23 20:47:30,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=830, Invalid=6310, Unknown=0, NotChecked=0, Total=7140 [2019-11-23 20:47:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-23 20:47:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2019-11-23 20:47:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 20:47:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2019-11-23 20:47:30,246 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 65 [2019-11-23 20:47:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:30,247 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2019-11-23 20:47:30,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 20:47:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2019-11-23 20:47:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 20:47:30,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:30,248 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:30,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:30,452 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash -654047625, now seen corresponding path program 10 times [2019-11-23 20:47:30,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:30,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905513034] [2019-11-23 20:47:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 60 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:31,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905513034] [2019-11-23 20:47:31,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874929407] [2019-11-23 20:47:31,641 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:31,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:47:31,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:31,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 20:47:31,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:31,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:47:31,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:31,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:31,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:31,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:47:31,857 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:47:31,858 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 24 treesize of output 23 [2019-11-23 20:47:31,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:31,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:31,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:31,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-23 20:47:32,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:32,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:32,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2019-11-23 20:47:32,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330856884] [2019-11-23 20:47:32,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-23 20:47:32,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-23 20:47:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 20:47:32,180 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand 37 states. [2019-11-23 20:47:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:36,254 INFO L93 Difference]: Finished difference Result 366 states and 437 transitions. [2019-11-23 20:47:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-23 20:47:36,256 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-23 20:47:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:36,257 INFO L225 Difference]: With dead ends: 366 [2019-11-23 20:47:36,258 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 20:47:36,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=897, Invalid=8609, Unknown=0, NotChecked=0, Total=9506 [2019-11-23 20:47:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 20:47:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 270. [2019-11-23 20:47:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-23 20:47:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 331 transitions. [2019-11-23 20:47:36,370 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 331 transitions. Word has length 76 [2019-11-23 20:47:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:36,370 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 331 transitions. [2019-11-23 20:47:36,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-23 20:47:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 331 transitions. [2019-11-23 20:47:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 20:47:36,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:36,371 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:36,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:36,572 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -405901131, now seen corresponding path program 4 times [2019-11-23 20:47:36,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:36,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081176766] [2019-11-23 20:47:36,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 60 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:37,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081176766] [2019-11-23 20:47:37,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154137637] [2019-11-23 20:47:37,863 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:37,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:47:37,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:37,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 20:47:37,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:38,118 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:47:38,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:38,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:47:38,164 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:47:38,164 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 23 treesize of output 22 [2019-11-23 20:47:38,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:38,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:38,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:47:38,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2019-11-23 20:47:38,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739811644] [2019-11-23 20:47:38,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:47:38,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:47:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:47:38,531 INFO L87 Difference]: Start difference. First operand 270 states and 331 transitions. Second operand 38 states. [2019-11-23 20:47:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:46,129 INFO L93 Difference]: Finished difference Result 441 states and 518 transitions. [2019-11-23 20:47:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-11-23 20:47:46,130 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-11-23 20:47:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:46,132 INFO L225 Difference]: With dead ends: 441 [2019-11-23 20:47:46,132 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 20:47:46,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1416, Invalid=12864, Unknown=0, NotChecked=0, Total=14280 [2019-11-23 20:47:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 20:47:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 299. [2019-11-23 20:47:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-23 20:47:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 373 transitions. [2019-11-23 20:47:46,250 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 373 transitions. Word has length 76 [2019-11-23 20:47:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:46,250 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 373 transitions. [2019-11-23 20:47:46,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:47:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 373 transitions. [2019-11-23 20:47:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 20:47:46,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:46,251 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:46,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:46,455 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash 453551213, now seen corresponding path program 11 times [2019-11-23 20:47:46,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:46,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258763758] [2019-11-23 20:47:46,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 112 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:47,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258763758] [2019-11-23 20:47:47,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29618526] [2019-11-23 20:47:47,664 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:47,761 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-11-23 20:47:47,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:47,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-23 20:47:47,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:47,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:47,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:47,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:47,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:47,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-23 20:47:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:48,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:48,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2019-11-23 20:47:48,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163936680] [2019-11-23 20:47:48,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-23 20:47:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-23 20:47:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1399, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 20:47:48,319 INFO L87 Difference]: Start difference. First operand 299 states and 373 transitions. Second operand 40 states. [2019-11-23 20:47:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:52,496 INFO L93 Difference]: Finished difference Result 715 states and 877 transitions. [2019-11-23 20:47:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-23 20:47:52,496 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-11-23 20:47:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:52,499 INFO L225 Difference]: With dead ends: 715 [2019-11-23 20:47:52,499 INFO L226 Difference]: Without dead ends: 674 [2019-11-23 20:47:52,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2989 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1033, Invalid=9067, Unknown=0, NotChecked=0, Total=10100 [2019-11-23 20:47:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-23 20:47:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 569. [2019-11-23 20:47:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-11-23 20:47:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 725 transitions. [2019-11-23 20:47:52,731 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 725 transitions. Word has length 80 [2019-11-23 20:47:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:52,732 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 725 transitions. [2019-11-23 20:47:52,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-23 20:47:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 725 transitions. [2019-11-23 20:47:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 20:47:52,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:52,733 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:52,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:52,934 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash -443842065, now seen corresponding path program 6 times [2019-11-23 20:47:52,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:52,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70327857] [2019-11-23 20:47:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 112 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:54,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70327857] [2019-11-23 20:47:54,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364734922] [2019-11-23 20:47:54,155 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:54,250 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-11-23 20:47:54,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:54,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 20:47:54,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:54,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:47:54,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:54,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:54,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:54,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:47:54,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:54,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:54,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2019-11-23 20:47:54,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969262104] [2019-11-23 20:47:54,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-23 20:47:54,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:54,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-23 20:47:54,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 20:47:54,807 INFO L87 Difference]: Start difference. First operand 569 states and 725 transitions. Second operand 40 states. [2019-11-23 20:47:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:59,860 INFO L93 Difference]: Finished difference Result 860 states and 1069 transitions. [2019-11-23 20:47:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-23 20:47:59,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-11-23 20:47:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:59,863 INFO L225 Difference]: With dead ends: 860 [2019-11-23 20:47:59,863 INFO L226 Difference]: Without dead ends: 819 [2019-11-23 20:47:59,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1017, Invalid=8883, Unknown=0, NotChecked=0, Total=9900 [2019-11-23 20:47:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-23 20:48:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 656. [2019-11-23 20:48:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-23 20:48:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 860 transitions. [2019-11-23 20:48:00,279 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 860 transitions. Word has length 80 [2019-11-23 20:48:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:00,280 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 860 transitions. [2019-11-23 20:48:00,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-23 20:48:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 860 transitions. [2019-11-23 20:48:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 20:48:00,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:00,281 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:00,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:00,485 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1076955022, now seen corresponding path program 12 times [2019-11-23 20:48:00,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:00,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274095279] [2019-11-23 20:48:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274095279] [2019-11-23 20:48:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413212830] [2019-11-23 20:48:00,814 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:00,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-23 20:48:00,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:00,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 20:48:00,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:00,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:48:00,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:01,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:48:01,017 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:01,017 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 30 treesize of output 29 [2019-11-23 20:48:01,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:01,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:48:01,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-11-23 20:48:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:01,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:01,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2019-11-23 20:48:01,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105479602] [2019-11-23 20:48:01,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:48:01,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:48:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:48:01,343 INFO L87 Difference]: Start difference. First operand 656 states and 860 transitions. Second operand 32 states.