/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/nr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:46:11,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:46:11,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:46:12,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:46:12,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:46:12,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:46:12,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:46:12,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:46:12,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:46:12,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:46:12,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:46:12,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:46:12,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:46:12,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:46:12,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:46:12,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:46:12,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:46:12,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:46:12,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:46:12,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:46:12,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:46:12,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:46:12,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:46:12,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:46:12,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:46:12,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:46:12,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:46:12,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:46:12,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:46:12,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:46:12,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:46:12,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:46:12,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:46:12,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:46:12,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:46:12,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:46:12,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:46:12,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:46:12,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:46:12,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:46:12,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:46:12,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:46:12,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:46:12,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:46:12,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:46:12,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:46:12,114 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:46:12,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:46:12,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:46:12,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:46:12,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:46:12,115 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:46:12,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:46:12,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:46:12,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:46:12,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:46:12,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:46:12,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:46:12,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:46:12,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:46:12,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:46:12,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:46:12,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:46:12,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:46:12,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:46:12,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:46:12,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:46:12,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:46:12,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:46:12,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:46:12,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:46:12,412 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:46:12,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3.c [2019-11-23 20:46:12,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ff178f3/01eb5c77b9dd472f8c746ceb07b4dce6/FLAG6ff9b29fc [2019-11-23 20:46:12,922 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:46:12,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3.c [2019-11-23 20:46:12,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ff178f3/01eb5c77b9dd472f8c746ceb07b4dce6/FLAG6ff9b29fc [2019-11-23 20:46:13,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ff178f3/01eb5c77b9dd472f8c746ceb07b4dce6 [2019-11-23 20:46:13,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:46:13,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:46:13,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:13,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:46:13,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:46:13,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:13" (1/1) ... [2019-11-23 20:46:13,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1348e435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:13, skipping insertion in model container [2019-11-23 20:46:13,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:46:13" (1/1) ... [2019-11-23 20:46:13,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:46:13,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:46:13,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:13,604 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:46:13,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:46:13,646 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:46:13,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:13 WrapperNode [2019-11-23 20:46:13,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:46:13,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:13,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:46:13,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:46:13,741 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:13" (1/1) ... [2019-11-23 20:46:13,751 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:13" (1/1) ... [2019-11-23 20:46:13,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:46:13,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:46:13,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:46:13,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:46:13,785 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:13" (1/1) ... [2019-11-23 20:46:13,786 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:13" (1/1) ... [2019-11-23 20:46:13,790 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:13" (1/1) ... [2019-11-23 20:46:13,790 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:13" (1/1) ... [2019-11-23 20:46:13,796 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:13" (1/1) ... [2019-11-23 20:46:13,802 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:13" (1/1) ... [2019-11-23 20:46:13,803 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:13" (1/1) ... [2019-11-23 20:46:13,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:46:13,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:46:13,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:46:13,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:46:13,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:13" (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:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:46:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:46:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:46:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:46:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:46:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:46:14,163 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:46:14,163 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 20:46:14,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:14 BoogieIcfgContainer [2019-11-23 20:46:14,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:46:14,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:46:14,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:46:14,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:46:14,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:46:13" (1/3) ... [2019-11-23 20:46:14,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d559e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:14, skipping insertion in model container [2019-11-23 20:46:14,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:46:13" (2/3) ... [2019-11-23 20:46:14,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d559e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:46:14, skipping insertion in model container [2019-11-23 20:46:14,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:46:14" (3/3) ... [2019-11-23 20:46:14,185 INFO L109 eAbstractionObserver]: Analyzing ICFG nr3.c [2019-11-23 20:46:14,196 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:46:14,208 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:46:14,240 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:46:14,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:46:14,265 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:46:14,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:46:14,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:46:14,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:46:14,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:46:14,266 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:46:14,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:46:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-23 20:46:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:14,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:14,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:14,293 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2072761718, now seen corresponding path program 1 times [2019-11-23 20:46:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:14,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65936213] [2019-11-23 20:46:14,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:14,504 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:14,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65936213] [2019-11-23 20:46:14,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:14,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:14,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163028059] [2019-11-23 20:46:14,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:14,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:14,526 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-11-23 20:46:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:14,626 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-11-23 20:46:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:14,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:14,637 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:46:14,637 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:14,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-11-23 20:46:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 20:46:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-23 20:46:14,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2019-11-23 20:46:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:14,671 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-23 20:46:14,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-23 20:46:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:46:14,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:14,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:14,673 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2072821300, now seen corresponding path program 1 times [2019-11-23 20:46:14,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:14,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120267597] [2019-11-23 20:46:14,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:14,872 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:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120267597] [2019-11-23 20:46:14,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:14,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:46:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373834953] [2019-11-23 20:46:14,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:14,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:14,877 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-11-23 20:46:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:14,932 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-23 20:46:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:14,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:46:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:14,934 INFO L225 Difference]: With dead ends: 36 [2019-11-23 20:46:14,934 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 20:46:14,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 20:46:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-23 20:46:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:46:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 20:46:14,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 20:46:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:14,942 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 20:46:14,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 20:46:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 20:46:14,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:14,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:14,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -594620155, now seen corresponding path program 1 times [2019-11-23 20:46:14,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:14,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246884353] [2019-11-23 20:46:14,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246884353] [2019-11-23 20:46:15,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:15,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:46:15,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048367681] [2019-11-23 20:46:15,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:46:15,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:46:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:15,015 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-23 20:46:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:15,048 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-23 20:46:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:46:15,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 20:46:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:15,049 INFO L225 Difference]: With dead ends: 40 [2019-11-23 20:46:15,049 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 20:46:15,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:46:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 20:46:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-23 20:46:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:46:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 20:46:15,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-23 20:46:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:15,056 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 20:46:15,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:46:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 20:46:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 20:46:15,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:15,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:15,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2056923621, now seen corresponding path program 1 times [2019-11-23 20:46:15,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:15,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069555679] [2019-11-23 20:46:15,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:15,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069555679] [2019-11-23 20:46:15,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523379864] [2019-11-23 20:46:15,138 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:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:15,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:46:15,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:15,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 20:46:15,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312006297] [2019-11-23 20:46:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:46:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:46:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:15,222 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-23 20:46:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:15,268 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-11-23 20:46:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:46:15,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 20:46:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:15,270 INFO L225 Difference]: With dead ends: 44 [2019-11-23 20:46:15,270 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:46:15,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:46:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:46:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-23 20:46:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:46:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-23 20:46:15,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2019-11-23 20:46:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:15,277 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-23 20:46:15,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:46:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-23 20:46:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:46:15,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:15,279 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:15,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:15,484 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1686195899, now seen corresponding path program 2 times [2019-11-23 20:46:15,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:15,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624246278] [2019-11-23 20:46:15,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624246278] [2019-11-23 20:46:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602270084] [2019-11-23 20:46:15,600 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:15,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:15,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:15,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:46:15,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:15,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:15,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-23 20:46:15,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66757212] [2019-11-23 20:46:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:46:15,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:46:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:15,677 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-11-23 20:46:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:15,731 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-11-23 20:46:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:46:15,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-23 20:46:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:15,736 INFO L225 Difference]: With dead ends: 48 [2019-11-23 20:46:15,736 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 20:46:15,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:46:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 20:46:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-23 20:46:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:46:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-23 20:46:15,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 20 [2019-11-23 20:46:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:15,746 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-23 20:46:15,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:46:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-23 20:46:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:15,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:15,748 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:15,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:15,952 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 302452187, now seen corresponding path program 3 times [2019-11-23 20:46:15,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:15,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410780544] [2019-11-23 20:46:15,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:16,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410780544] [2019-11-23 20:46:16,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:46:16,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:46:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028875526] [2019-11-23 20:46:16,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:46:16,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:46:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:46:16,055 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2019-11-23 20:46:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:16,128 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-11-23 20:46:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:46:16,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-23 20:46:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:16,132 INFO L225 Difference]: With dead ends: 55 [2019-11-23 20:46:16,132 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 20:46:16,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:46:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 20:46:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-23 20:46:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 20:46:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-23 20:46:16,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2019-11-23 20:46:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:16,140 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-23 20:46:16,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:46:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-23 20:46:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:46:16,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:16,141 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:16,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1003516765, now seen corresponding path program 1 times [2019-11-23 20:46:16,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:16,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885545477] [2019-11-23 20:46:16,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:16,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885545477] [2019-11-23 20:46:16,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796704020] [2019-11-23 20:46:16,712 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:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:16,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:46:16,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:16,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-23 20:46:16,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:16,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:16,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:16,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:16,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:16,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-23 20:46:16,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:16,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:16,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:16,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:17,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:17,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:17,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 105 [2019-11-23 20:46:17,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:17,134 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-23 20:46:17,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:17,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:64 [2019-11-23 20:46:17,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:46:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,852 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-23 20:46:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:17,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:17,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2019-11-23 20:46:17,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004677612] [2019-11-23 20:46:17,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:46:17,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:46:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:46:17,907 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 23 states. [2019-11-23 20:46:18,384 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-23 20:46:22,460 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-23 20:46:22,707 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-11-23 20:46:22,861 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-23 20:46:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:24,350 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-11-23 20:46:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-23 20:46:24,351 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-11-23 20:46:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:24,353 INFO L225 Difference]: With dead ends: 165 [2019-11-23 20:46:24,354 INFO L226 Difference]: Without dead ends: 139 [2019-11-23 20:46:24,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=749, Invalid=2911, Unknown=0, NotChecked=0, Total=3660 [2019-11-23 20:46:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-23 20:46:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 35. [2019-11-23 20:46:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 20:46:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-23 20:46:24,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 23 [2019-11-23 20:46:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:24,366 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-23 20:46:24,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:46:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-23 20:46:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:46:24,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:24,368 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:24,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:24,571 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1647923088, now seen corresponding path program 1 times [2019-11-23 20:46:24,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:24,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144062503] [2019-11-23 20:46:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:24,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144062503] [2019-11-23 20:46:24,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729969978] [2019-11-23 20:46:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:24,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:46:24,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:24,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-23 20:46:24,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:24,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:24,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:24,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:24,995 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:24,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:25,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:25,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:25,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-11-23 20:46:25,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:25,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:25,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-23 20:46:25,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803141651] [2019-11-23 20:46:25,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:46:25,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:46:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:46:25,157 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 22 states. [2019-11-23 20:46:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:25,564 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2019-11-23 20:46:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 20:46:25,564 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-23 20:46:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:25,567 INFO L225 Difference]: With dead ends: 107 [2019-11-23 20:46:25,567 INFO L226 Difference]: Without dead ends: 79 [2019-11-23 20:46:25,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:46:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-23 20:46:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2019-11-23 20:46:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 20:46:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-23 20:46:25,578 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 29 [2019-11-23 20:46:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:25,579 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-23 20:46:25,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:46:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-23 20:46:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:46:25,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:25,580 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:25,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:25,792 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2137717123, now seen corresponding path program 2 times [2019-11-23 20:46:25,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:25,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172696133] [2019-11-23 20:46:25,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:25,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172696133] [2019-11-23 20:46:25,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285187384] [2019-11-23 20:46:25,986 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:26,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:46:26,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:26,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:46:26,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:26,050 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:26,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:26,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:26,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:26,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-23 20:46:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:26,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:26,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-23 20:46:26,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963395210] [2019-11-23 20:46:26,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:46:26,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:46:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:46:26,147 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 17 states. [2019-11-23 20:46:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:26,609 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2019-11-23 20:46:26,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 20:46:26,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-23 20:46:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:26,612 INFO L225 Difference]: With dead ends: 134 [2019-11-23 20:46:26,612 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 20:46:26,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:46:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 20:46:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2019-11-23 20:46:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-23 20:46:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-23 20:46:26,629 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 35 [2019-11-23 20:46:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:26,629 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-23 20:46:26,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:46:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-23 20:46:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:26,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:26,631 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:26,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:26,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1736712502, now seen corresponding path program 3 times [2019-11-23 20:46:26,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:26,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823268063] [2019-11-23 20:46:26,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:46:27,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823268063] [2019-11-23 20:46:27,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667197612] [2019-11-23 20:46:27,211 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:27,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:46:27,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:27,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:46:27,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:46:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:46:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:46:27,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:27,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-11-23 20:46:27,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50445505] [2019-11-23 20:46:27,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:46:27,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:46:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:46:27,489 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 19 states. [2019-11-23 20:46:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:46:27,785 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2019-11-23 20:46:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:46:27,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-11-23 20:46:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:46:27,786 INFO L225 Difference]: With dead ends: 124 [2019-11-23 20:46:27,786 INFO L226 Difference]: Without dead ends: 94 [2019-11-23 20:46:27,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:46:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-23 20:46:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2019-11-23 20:46:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-23 20:46:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-23 20:46:27,798 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 41 [2019-11-23 20:46:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:46:27,799 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-23 20:46:27,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:46:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-23 20:46:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:46:27,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:46:27,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:46:28,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:28,005 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:46:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:46:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 522415225, now seen corresponding path program 4 times [2019-11-23 20:46:28,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:46:28,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268666044] [2019-11-23 20:46:28,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:46:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:46:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268666044] [2019-11-23 20:46:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050909938] [2019-11-23 20:46:28,401 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:46:28,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:46:28,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:46:28,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:46:28,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:46:28,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-23 20:46:28,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:28,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:28,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:46:28,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-23 20:46:28,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:28,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-23 20:46:28,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:28,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:28,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:28,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-23 20:46:28,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:28,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:28,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:28,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2019-11-23 20:46:28,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:28,858 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.8 percent of original size [2019-11-23 20:46:28,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:28,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:28,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:67 [2019-11-23 20:46:28,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:30,922 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-23 20:46:30,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:32,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:32,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:32,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:32,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:32,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-11-23 20:46:32,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:32,442 INFO L567 ElimStorePlain]: treesize reduction 7, result has 88.7 percent of original size [2019-11-23 20:46:32,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:32,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:55 [2019-11-23 20:46:35,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:46:35,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 61 [2019-11-23 20:46:35,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:46:35,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:46:35,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 20:46:35,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:74 [2019-11-23 20:46:37,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:46:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 61 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:46:37,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:46:37,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2019-11-23 20:46:37,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548137316] [2019-11-23 20:46:37,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-23 20:46:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:46:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-23 20:46:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1083, Unknown=2, NotChecked=0, Total=1332 [2019-11-23 20:46:37,964 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 37 states. [2019-11-23 20:47:30,242 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-23 20:47:34,367 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-23 20:47:36,529 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-23 20:47:38,637 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-23 20:47:44,766 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-23 20:47:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:44,852 INFO L93 Difference]: Finished difference Result 190 states and 221 transitions. [2019-11-23 20:47:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 20:47:44,853 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 41 [2019-11-23 20:47:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:44,854 INFO L225 Difference]: With dead ends: 190 [2019-11-23 20:47:44,854 INFO L226 Difference]: Without dead ends: 128 [2019-11-23 20:47:44,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=589, Invalid=2826, Unknown=7, NotChecked=0, Total=3422 [2019-11-23 20:47:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-23 20:47:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 78. [2019-11-23 20:47:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 20:47:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-23 20:47:44,871 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 41 [2019-11-23 20:47:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:44,871 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-23 20:47:44,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-23 20:47:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-23 20:47:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:47:44,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:44,873 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:45,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:45,076 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1193540692, now seen corresponding path program 5 times [2019-11-23 20:47:45,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:45,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183341843] [2019-11-23 20:47:45,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:47:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183341843] [2019-11-23 20:47:45,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646480468] [2019-11-23 20:47:45,339 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 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:47:45,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:47:45,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:45,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:47:45,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:45,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-23 20:47:45,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:45,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:45,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:47:45,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-23 20:47:45,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:45,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:47:45,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-11-23 20:47:45,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2019-11-23 20:47:45,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:45,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:47:45,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2019-11-23 20:47:45,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:45,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2019-11-23 20:47:45,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:45,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:45,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 20:47:45,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:66 [2019-11-23 20:47:46,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:47:46,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:46,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-23 20:47:46,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551766281] [2019-11-23 20:47:46,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 20:47:46,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:46,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 20:47:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:47:46,321 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 36 states. [2019-11-23 20:47:59,428 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45