/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:53:26,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:53:26,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:53:26,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:53:26,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:53:26,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:53:26,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:53:26,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:53:26,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:53:26,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:53:26,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:53:26,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:53:26,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:53:26,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:53:26,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:53:26,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:53:26,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:53:26,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:53:26,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:53:26,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:53:26,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:53:26,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:53:26,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:53:26,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:53:26,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:53:26,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:53:26,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:53:26,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:53:26,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:53:26,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:53:26,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:53:26,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:53:26,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:53:26,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:53:26,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:53:26,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:53:26,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:53:26,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:53:26,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:53:26,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:53:26,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:53:26,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 18:53:26,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:53:26,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:53:26,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:53:26,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:53:26,180 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:53:26,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:53:26,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:53:26,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:53:26,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:53:26,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:53:26,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:53:26,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:53:26,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:53:26,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:53:26,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:53:26,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:53:26,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:53:26,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:53:26,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:53:26,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:53:26,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:53:26,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:53:26,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:53:26,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:53:26,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:53:26,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:53:26,458 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:53:26,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr2.c [2019-11-06 18:53:26,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dba1e2b/cfe6e92ad04c4a8eb7960bab67908c7d/FLAG270b08130 [2019-11-06 18:53:26,937 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:53:26,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr2.c [2019-11-06 18:53:26,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dba1e2b/cfe6e92ad04c4a8eb7960bab67908c7d/FLAG270b08130 [2019-11-06 18:53:27,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dba1e2b/cfe6e92ad04c4a8eb7960bab67908c7d [2019-11-06 18:53:27,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:53:27,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:53:27,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:53:27,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:53:27,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:53:27,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deb8361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27, skipping insertion in model container [2019-11-06 18:53:27,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:53:27,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:53:27,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:53:27,589 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:53:27,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:53:27,632 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:53:27,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27 WrapperNode [2019-11-06 18:53:27,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:53:27,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:53:27,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:53:27,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:53:27,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... [2019-11-06 18:53:27,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:53:27,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:53:27,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:53:27,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:53:27,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:53:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:53:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:53:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:53:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:53:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:53:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:53:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:53:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:53:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:53:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:53:28,204 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:53:28,205 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 18:53:28,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:28 BoogieIcfgContainer [2019-11-06 18:53:28,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:53:28,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:53:28,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:53:28,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:53:28,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:53:27" (1/3) ... [2019-11-06 18:53:28,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22778026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:28, skipping insertion in model container [2019-11-06 18:53:28,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:27" (2/3) ... [2019-11-06 18:53:28,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22778026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:28, skipping insertion in model container [2019-11-06 18:53:28,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:28" (3/3) ... [2019-11-06 18:53:28,215 INFO L109 eAbstractionObserver]: Analyzing ICFG pr2.c [2019-11-06 18:53:28,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:53:28,240 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:53:28,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:53:28,290 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:53:28,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:53:28,291 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:53:28,291 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:53:28,291 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:53:28,291 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:53:28,291 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:53:28,291 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:53:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-06 18:53:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:53:28,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:28,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:28,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 435909, now seen corresponding path program 1 times [2019-11-06 18:53:28,351 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:28,351 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944080954] [2019-11-06 18:53:28,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:28,672 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944080954] [2019-11-06 18:53:28,673 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:28,673 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 18:53:28,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469904298] [2019-11-06 18:53:28,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:53:28,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:53:28,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:28,697 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 6 states. [2019-11-06 18:53:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:28,954 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-11-06 18:53:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:53:28,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 18:53:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:28,973 INFO L225 Difference]: With dead ends: 54 [2019-11-06 18:53:28,973 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 18:53:28,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:53:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 18:53:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-06 18:53:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 18:53:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-06 18:53:29,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-11-06 18:53:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:29,047 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-06 18:53:29,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:53:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-06 18:53:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:53:29,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:29,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:29,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2282951, now seen corresponding path program 1 times [2019-11-06 18:53:29,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:29,053 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642380088] [2019-11-06 18:53:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:29,173 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642380088] [2019-11-06 18:53:29,173 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:29,174 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:29,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745455494] [2019-11-06 18:53:29,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:29,176 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:29,177 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-11-06 18:53:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:29,331 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-11-06 18:53:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:53:29,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 18:53:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:29,337 INFO L225 Difference]: With dead ends: 50 [2019-11-06 18:53:29,337 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 18:53:29,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 18:53:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-06 18:53:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 18:53:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 18:53:29,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-11-06 18:53:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:29,357 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 18:53:29,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 18:53:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 18:53:29,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:29,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:29,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1753718226, now seen corresponding path program 1 times [2019-11-06 18:53:29,363 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:29,363 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263954506] [2019-11-06 18:53:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:29,754 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263954506] [2019-11-06 18:53:29,754 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700671589] [2019-11-06 18:53:29,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:29,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 18:53:29,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:29,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:29,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:29,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:29,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:29,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:29,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:29,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 18:53:29,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:29,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:29,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:29,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-06 18:53:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:30,034 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:30,034 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-06 18:53:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68330085] [2019-11-06 18:53:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 18:53:30,036 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 18:53:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-06 18:53:30,037 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 16 states. [2019-11-06 18:53:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:30,693 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2019-11-06 18:53:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 18:53:30,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-11-06 18:53:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:30,697 INFO L225 Difference]: With dead ends: 99 [2019-11-06 18:53:30,697 INFO L226 Difference]: Without dead ends: 83 [2019-11-06 18:53:30,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-11-06 18:53:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-06 18:53:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 37. [2019-11-06 18:53:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 18:53:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-11-06 18:53:30,714 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2019-11-06 18:53:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:30,715 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-06 18:53:30,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 18:53:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-11-06 18:53:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 18:53:30,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:30,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:30,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:30,925 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1052653648, now seen corresponding path program 1 times [2019-11-06 18:53:30,926 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:30,927 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432124630] [2019-11-06 18:53:30,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:30,992 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432124630] [2019-11-06 18:53:30,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:30,993 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:30,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998190357] [2019-11-06 18:53:30,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:30,994 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:30,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:30,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:30,994 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 5 states. [2019-11-06 18:53:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:31,096 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-11-06 18:53:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:53:31,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 18:53:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:31,098 INFO L225 Difference]: With dead ends: 64 [2019-11-06 18:53:31,098 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 18:53:31,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 18:53:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-11-06 18:53:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 18:53:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-06 18:53:31,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2019-11-06 18:53:31,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:31,108 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-06 18:53:31,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-06 18:53:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 18:53:31,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:31,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:31,109 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1445680658, now seen corresponding path program 1 times [2019-11-06 18:53:31,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:31,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042437695] [2019-11-06 18:53:31,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:31,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042437695] [2019-11-06 18:53:31,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250746783] [2019-11-06 18:53:31,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:31,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 18:53:31,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:31,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:31,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:31,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-06 18:53:31,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2019-11-06 18:53:31,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:31,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:31,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:31,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 38 [2019-11-06 18:53:31,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:31,453 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,466 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.4 percent of original size [2019-11-06 18:53:31,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:31,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:38 [2019-11-06 18:53:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:31,540 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:31,540 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-06 18:53:31,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369029503] [2019-11-06 18:53:31,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 18:53:31,541 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 18:53:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:53:31,542 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 15 states. [2019-11-06 18:53:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:31,998 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-11-06 18:53:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 18:53:31,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-11-06 18:53:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:32,000 INFO L225 Difference]: With dead ends: 73 [2019-11-06 18:53:32,000 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 18:53:32,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-06 18:53:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 18:53:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-11-06 18:53:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 18:53:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-11-06 18:53:32,020 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 20 [2019-11-06 18:53:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:32,021 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-11-06 18:53:32,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 18:53:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-11-06 18:53:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 18:53:32,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:32,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:32,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:32,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1227860693, now seen corresponding path program 1 times [2019-11-06 18:53:32,234 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:32,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146491839] [2019-11-06 18:53:32,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:32,282 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146491839] [2019-11-06 18:53:32,282 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:32,282 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:32,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099205959] [2019-11-06 18:53:32,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:32,288 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:32,288 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 4 states. [2019-11-06 18:53:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:32,367 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2019-11-06 18:53:32,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:32,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 18:53:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:32,369 INFO L225 Difference]: With dead ends: 77 [2019-11-06 18:53:32,369 INFO L226 Difference]: Without dead ends: 56 [2019-11-06 18:53:32,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-06 18:53:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-06 18:53:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 18:53:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-06 18:53:32,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 24 [2019-11-06 18:53:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:32,379 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-06 18:53:32,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-06 18:53:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 18:53:32,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:32,381 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:32,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1764184813, now seen corresponding path program 1 times [2019-11-06 18:53:32,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:32,382 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279737613] [2019-11-06 18:53:32,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:32,417 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279737613] [2019-11-06 18:53:32,417 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:32,417 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:32,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470889073] [2019-11-06 18:53:32,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:32,418 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:32,419 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 4 states. [2019-11-06 18:53:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:32,474 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-11-06 18:53:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:32,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 18:53:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:32,475 INFO L225 Difference]: With dead ends: 72 [2019-11-06 18:53:32,475 INFO L226 Difference]: Without dead ends: 51 [2019-11-06 18:53:32,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-06 18:53:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-11-06 18:53:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 18:53:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-11-06 18:53:32,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 24 [2019-11-06 18:53:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:32,485 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-11-06 18:53:32,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-11-06 18:53:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 18:53:32,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:32,486 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:32,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1419737983, now seen corresponding path program 1 times [2019-11-06 18:53:32,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:32,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877186718] [2019-11-06 18:53:32,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:32,644 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877186718] [2019-11-06 18:53:32,645 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43527356] [2019-11-06 18:53:32,645 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-06 18:53:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:32,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 18:53:32,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:32,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 18:53:32,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:32,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:32,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:32,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-06 18:53:32,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:32,788 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:32,789 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-06 18:53:32,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239156377] [2019-11-06 18:53:32,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 18:53:32,789 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 18:53:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:53:32,790 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 15 states. [2019-11-06 18:53:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:33,291 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2019-11-06 18:53:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 18:53:33,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-11-06 18:53:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:33,293 INFO L225 Difference]: With dead ends: 99 [2019-11-06 18:53:33,293 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 18:53:33,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:53:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 18:53:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2019-11-06 18:53:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 18:53:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-06 18:53:33,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 29 [2019-11-06 18:53:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:33,307 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-06 18:53:33,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 18:53:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-11-06 18:53:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 18:53:33,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:33,310 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:33,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:33,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:33,514 INFO L82 PathProgramCache]: Analyzing trace with hash -269205759, now seen corresponding path program 1 times [2019-11-06 18:53:33,514 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:33,514 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277347783] [2019-11-06 18:53:33,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:33,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277347783] [2019-11-06 18:53:33,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082329150] [2019-11-06 18:53:33,616 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-06 18:53:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:33,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-06 18:53:33,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:33,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 18:53:33,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:33,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:33,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:33,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-06 18:53:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:33,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:33,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-06 18:53:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131013346] [2019-11-06 18:53:33,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 18:53:33,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:33,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 18:53:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-06 18:53:33,916 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 19 states. [2019-11-06 18:53:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:34,502 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-11-06 18:53:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 18:53:34,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-11-06 18:53:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:34,504 INFO L225 Difference]: With dead ends: 106 [2019-11-06 18:53:34,504 INFO L226 Difference]: Without dead ends: 104 [2019-11-06 18:53:34,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2019-11-06 18:53:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-06 18:53:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2019-11-06 18:53:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-06 18:53:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-11-06 18:53:34,521 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 29 [2019-11-06 18:53:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:34,522 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-11-06 18:53:34,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 18:53:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-11-06 18:53:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 18:53:34,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:34,523 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:34,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:34,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash -833830662, now seen corresponding path program 1 times [2019-11-06 18:53:34,731 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:34,731 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164233359] [2019-11-06 18:53:34,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:53:34,768 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164233359] [2019-11-06 18:53:34,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:34,769 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:34,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443130071] [2019-11-06 18:53:34,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:34,770 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:34,771 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 4 states. [2019-11-06 18:53:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:34,837 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-11-06 18:53:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:34,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-06 18:53:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:34,839 INFO L225 Difference]: With dead ends: 111 [2019-11-06 18:53:34,839 INFO L226 Difference]: Without dead ends: 88 [2019-11-06 18:53:34,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-06 18:53:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-11-06 18:53:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-06 18:53:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-11-06 18:53:34,862 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 33 [2019-11-06 18:53:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:34,865 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-11-06 18:53:34,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-11-06 18:53:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 18:53:34,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:34,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:34,873 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -358527666, now seen corresponding path program 2 times [2019-11-06 18:53:34,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:34,874 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091063749] [2019-11-06 18:53:34,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:35,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091063749] [2019-11-06 18:53:35,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113998159] [2019-11-06 18:53:35,182 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-06 18:53:35,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:53:35,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:35,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 18:53:35,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:53:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:53:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:35,414 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:35,414 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-06 18:53:35,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209549330] [2019-11-06 18:53:35,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 18:53:35,415 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 18:53:35,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-06 18:53:35,415 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 16 states. [2019-11-06 18:53:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:35,759 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2019-11-06 18:53:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:53:35,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-06 18:53:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:35,761 INFO L225 Difference]: With dead ends: 183 [2019-11-06 18:53:35,761 INFO L226 Difference]: Without dead ends: 103 [2019-11-06 18:53:35,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-11-06 18:53:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-06 18:53:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-11-06 18:53:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 18:53:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2019-11-06 18:53:35,775 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 38 [2019-11-06 18:53:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:35,775 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2019-11-06 18:53:35,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 18:53:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2019-11-06 18:53:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 18:53:35,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:35,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:35,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:35,982 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 502956661, now seen corresponding path program 3 times [2019-11-06 18:53:35,983 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:35,983 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004941525] [2019-11-06 18:53:35,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:36,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004941525] [2019-11-06 18:53:36,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245616195] [2019-11-06 18:53:36,189 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:36,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:53:36,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:36,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 18:53:36,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:36,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:36,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:36,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:36,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:36,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-06 18:53:36,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:36,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:36,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:36,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:36,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:36,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-06 18:53:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:36,646 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:36,646 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-11-06 18:53:36,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417334608] [2019-11-06 18:53:36,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 18:53:36,647 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 18:53:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-11-06 18:53:36,648 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 23 states. [2019-11-06 18:53:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:37,685 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2019-11-06 18:53:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 18:53:37,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-06 18:53:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:37,687 INFO L225 Difference]: With dead ends: 133 [2019-11-06 18:53:37,687 INFO L226 Difference]: Without dead ends: 117 [2019-11-06 18:53:37,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2019-11-06 18:53:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-06 18:53:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2019-11-06 18:53:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-06 18:53:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-11-06 18:53:37,702 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 42 [2019-11-06 18:53:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:37,702 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-11-06 18:53:37,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-06 18:53:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-11-06 18:53:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 18:53:37,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:37,703 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:37,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:37,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 268243185, now seen corresponding path program 2 times [2019-11-06 18:53:37,908 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:37,908 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607009026] [2019-11-06 18:53:37,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:38,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607009026] [2019-11-06 18:53:38,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694957216] [2019-11-06 18:53:38,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:38,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:53:38,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:38,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-06 18:53:38,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:38,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:38,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:38,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:38,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:38,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:53:38,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:38,486 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:38,486 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-06 18:53:38,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363485690] [2019-11-06 18:53:38,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:53:38,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:38,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:53:38,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:53:38,487 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 22 states. [2019-11-06 18:53:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:39,414 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2019-11-06 18:53:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:53:39,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-11-06 18:53:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:39,416 INFO L225 Difference]: With dead ends: 159 [2019-11-06 18:53:39,416 INFO L226 Difference]: Without dead ends: 143 [2019-11-06 18:53:39,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-11-06 18:53:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-06 18:53:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-11-06 18:53:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-06 18:53:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2019-11-06 18:53:39,441 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 42 [2019-11-06 18:53:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:39,442 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2019-11-06 18:53:39,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:53:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2019-11-06 18:53:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 18:53:39,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:39,443 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:39,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:39,647 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1582060021, now seen corresponding path program 1 times [2019-11-06 18:53:39,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:39,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599699972] [2019-11-06 18:53:39,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:39,813 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599699972] [2019-11-06 18:53:39,813 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086192041] [2019-11-06 18:53:39,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 18:53:39,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:39,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:39,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:39,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:39,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:39,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:53:39,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:39,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:39,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:39,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:39,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:39,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:53:40,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:40,193 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:40,193 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-06 18:53:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794373403] [2019-11-06 18:53:40,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:53:40,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:53:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:53:40,197 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 24 states. [2019-11-06 18:53:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:41,036 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2019-11-06 18:53:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 18:53:41,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-11-06 18:53:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:41,039 INFO L225 Difference]: With dead ends: 169 [2019-11-06 18:53:41,039 INFO L226 Difference]: Without dead ends: 167 [2019-11-06 18:53:41,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2019-11-06 18:53:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-06 18:53:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-11-06 18:53:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-06 18:53:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2019-11-06 18:53:41,057 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 42 [2019-11-06 18:53:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:41,057 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2019-11-06 18:53:41,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:53:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2019-11-06 18:53:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 18:53:41,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:41,059 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:41,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:41,265 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -287327464, now seen corresponding path program 4 times [2019-11-06 18:53:41,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:41,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259920719] [2019-11-06 18:53:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:41,413 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259920719] [2019-11-06 18:53:41,413 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557156248] [2019-11-06 18:53:41,414 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:41,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:53:41,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:41,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-06 18:53:41,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:41,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 18:53:41,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:41,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:41,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:41,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-06 18:53:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:41,681 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:41,681 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-06 18:53:41,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376400691] [2019-11-06 18:53:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:53:41,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:53:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:53:41,682 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 22 states. [2019-11-06 18:53:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:42,337 INFO L93 Difference]: Finished difference Result 188 states and 218 transitions. [2019-11-06 18:53:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 18:53:42,340 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-11-06 18:53:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:42,341 INFO L225 Difference]: With dead ends: 188 [2019-11-06 18:53:42,342 INFO L226 Difference]: Without dead ends: 172 [2019-11-06 18:53:42,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 18:53:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-06 18:53:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2019-11-06 18:53:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-06 18:53:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2019-11-06 18:53:42,362 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 51 [2019-11-06 18:53:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:42,363 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2019-11-06 18:53:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:53:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2019-11-06 18:53:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 18:53:42,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:42,364 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:42,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:42,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash 795850780, now seen corresponding path program 3 times [2019-11-06 18:53:42,569 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:42,569 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165898272] [2019-11-06 18:53:42,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:42,730 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165898272] [2019-11-06 18:53:42,731 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514738756] [2019-11-06 18:53:42,731 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:42,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 18:53:42,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:42,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 18:53:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:42,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:42,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:42,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:42,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:53:42,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-06 18:53:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:59,747 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:59,747 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 19 [2019-11-06 18:53:59,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368759834] [2019-11-06 18:53:59,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 18:53:59,748 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:59,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 18:53:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=288, Unknown=3, NotChecked=0, Total=342 [2019-11-06 18:53:59,749 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 19 states. [2019-11-06 18:54:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:11,982 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2019-11-06 18:54:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-06 18:54:11,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-11-06 18:54:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:11,985 INFO L225 Difference]: With dead ends: 207 [2019-11-06 18:54:11,985 INFO L226 Difference]: Without dead ends: 205 [2019-11-06 18:54:11,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=213, Invalid=1342, Unknown=5, NotChecked=0, Total=1560 [2019-11-06 18:54:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-06 18:54:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2019-11-06 18:54:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-06 18:54:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2019-11-06 18:54:12,003 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 51 [2019-11-06 18:54:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:12,003 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2019-11-06 18:54:12,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 18:54:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2019-11-06 18:54:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 18:54:12,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:12,005 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:12,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:12,209 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -350451243, now seen corresponding path program 5 times [2019-11-06 18:54:12,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:12,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880616980] [2019-11-06 18:54:12,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:12,638 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880616980] [2019-11-06 18:54:12,638 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563986125] [2019-11-06 18:54:12,638 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:12,702 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-06 18:54:12,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:12,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 18:54:12,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:12,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:12,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:54:12,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:54:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:12,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:12,969 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-06 18:54:12,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224110227] [2019-11-06 18:54:12,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:54:12,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:54:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:54:12,970 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 22 states. [2019-11-06 18:54:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:13,566 INFO L93 Difference]: Finished difference Result 331 states and 379 transitions. [2019-11-06 18:54:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 18:54:13,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-11-06 18:54:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:13,568 INFO L225 Difference]: With dead ends: 331 [2019-11-06 18:54:13,568 INFO L226 Difference]: Without dead ends: 179 [2019-11-06 18:54:13,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-11-06 18:54:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-06 18:54:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2019-11-06 18:54:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-06 18:54:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2019-11-06 18:54:13,588 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 60 [2019-11-06 18:54:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:13,588 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2019-11-06 18:54:13,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:54:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2019-11-06 18:54:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 18:54:13,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:13,590 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:13,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:13,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:13,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1208068164, now seen corresponding path program 6 times [2019-11-06 18:54:13,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:13,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926359630] [2019-11-06 18:54:13,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:14,046 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926359630] [2019-11-06 18:54:14,046 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892184552] [2019-11-06 18:54:14,046 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:14,110 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-06 18:54:14,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:14,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 18:54:14,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:14,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:54:14,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:14,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:14,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:14,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:54:14,252 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-06 18:54:14,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:54:14,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:14,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:14,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:14,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2019-11-06 18:54:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:14,850 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:14,850 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-11-06 18:54:14,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726996869] [2019-11-06 18:54:14,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-06 18:54:14,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-06 18:54:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-11-06 18:54:14,852 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand 29 states.