/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:21:24,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:21:24,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:21:24,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:21:24,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:21:24,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:21:24,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:21:24,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:21:24,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:21:24,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:21:24,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:21:24,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:21:24,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:21:24,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:21:24,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:21:24,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:21:24,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:21:24,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:21:24,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:21:24,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:21:24,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:21:24,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:21:24,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:21:24,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:21:24,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:21:24,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:21:24,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:21:24,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:21:24,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:21:24,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:21:24,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:21:24,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:21:24,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:21:24,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:21:24,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:21:24,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:21:24,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:21:24,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:21:24,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:21:24,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:21:24,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:21:24,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:21:24,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:21:24,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:21:24,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:21:24,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:21:24,180 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:21:24,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:21:24,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:21:24,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:21:24,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:21:24,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:21:24,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:21:24,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:21:24,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:21:24,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:21:24,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:21:24,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:21:24,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:21:24,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:21:24,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:21:24,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:21:24,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:21:24,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:21:24,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:21:24,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:21:24,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:21:24,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:21:24,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:21:24,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:21:24,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:21:24,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:21:24,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label04.c [2019-11-23 21:21:24,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272c9344/b615a0370bfb46ac9656f6edc824da17/FLAG2a8e1b060 [2019-11-23 21:21:25,243 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:21:25,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label04.c [2019-11-23 21:21:25,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272c9344/b615a0370bfb46ac9656f6edc824da17/FLAG2a8e1b060 [2019-11-23 21:21:25,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272c9344/b615a0370bfb46ac9656f6edc824da17 [2019-11-23 21:21:25,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:21:25,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:21:25,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:21:25,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:21:25,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:21:25,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:25" (1/1) ... [2019-11-23 21:21:25,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262ce2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:25, skipping insertion in model container [2019-11-23 21:21:25,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:25" (1/1) ... [2019-11-23 21:21:25,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:21:25,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:21:26,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:21:26,666 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:21:27,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:21:27,143 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:21:27,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27 WrapperNode [2019-11-23 21:21:27,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:21:27,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:21:27,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:21:27,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:21:27,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:21:27,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:21:27,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:21:27,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:21:27,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (1/1) ... [2019-11-23 21:21:27,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:21:27,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:21:27,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:21:27,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:21:27,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21: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-23 21:21:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:21:27,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:21:32,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:21:32,775 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:21:32,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:32 BoogieIcfgContainer [2019-11-23 21:21:32,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:21:32,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:21:32,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:21:32,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:21:32,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:21:25" (1/3) ... [2019-11-23 21:21:32,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9f9c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:32, skipping insertion in model container [2019-11-23 21:21:32,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:27" (2/3) ... [2019-11-23 21:21:32,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9f9c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:32, skipping insertion in model container [2019-11-23 21:21:32,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:32" (3/3) ... [2019-11-23 21:21:32,792 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label04.c [2019-11-23 21:21:32,803 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:21:32,814 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:21:32,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:21:32,864 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:21:32,864 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:21:32,864 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:21:32,864 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:21:32,864 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:21:32,865 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:21:32,865 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:21:32,865 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:21:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-11-23 21:21:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:21:32,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:32,900 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-23 21:21:32,901 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -279853278, now seen corresponding path program 1 times [2019-11-23 21:21:32,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:32,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49575114] [2019-11-23 21:21:32,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:21:33,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49575114] [2019-11-23 21:21:33,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:33,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:21:33,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297636271] [2019-11-23 21:21:33,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:21:33,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:21:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:33,134 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-11-23 21:21:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:40,478 INFO L93 Difference]: Finished difference Result 2095 states and 3900 transitions. [2019-11-23 21:21:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:40,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-23 21:21:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:40,508 INFO L225 Difference]: With dead ends: 2095 [2019-11-23 21:21:40,508 INFO L226 Difference]: Without dead ends: 1425 [2019-11-23 21:21:40,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-11-23 21:21:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1423. [2019-11-23 21:21:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-23 21:21:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2179 transitions. [2019-11-23 21:21:40,638 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2179 transitions. Word has length 20 [2019-11-23 21:21:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:40,639 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 2179 transitions. [2019-11-23 21:21:40,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2179 transitions. [2019-11-23 21:21:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 21:21:40,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:40,643 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:21:40,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 405382798, now seen corresponding path program 1 times [2019-11-23 21:21:40,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:40,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624147969] [2019-11-23 21:21:40,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:21:40,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624147969] [2019-11-23 21:21:40,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:40,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:21:40,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741058932] [2019-11-23 21:21:40,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:21:40,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:21:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:21:40,897 INFO L87 Difference]: Start difference. First operand 1423 states and 2179 transitions. Second operand 3 states. [2019-11-23 21:21:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:44,530 INFO L93 Difference]: Finished difference Result 4134 states and 6354 transitions. [2019-11-23 21:21:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:21:44,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-23 21:21:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:44,553 INFO L225 Difference]: With dead ends: 4134 [2019-11-23 21:21:44,554 INFO L226 Difference]: Without dead ends: 2713 [2019-11-23 21:21:44,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:21:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2019-11-23 21:21:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2019-11-23 21:21:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-11-23 21:21:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3733 transitions. [2019-11-23 21:21:44,623 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3733 transitions. Word has length 90 [2019-11-23 21:21:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:44,624 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 3733 transitions. [2019-11-23 21:21:44,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:21:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3733 transitions. [2019-11-23 21:21:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 21:21:44,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:44,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:21:44,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2068721851, now seen corresponding path program 1 times [2019-11-23 21:21:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:44,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20013907] [2019-11-23 21:21:44,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:21:44,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20013907] [2019-11-23 21:21:44,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:44,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:21:44,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633003958] [2019-11-23 21:21:44,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:21:44,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:21:44,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:21:44,859 INFO L87 Difference]: Start difference. First operand 2711 states and 3733 transitions. Second operand 3 states. [2019-11-23 21:21:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:48,358 INFO L93 Difference]: Finished difference Result 7974 states and 10985 transitions. [2019-11-23 21:21:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:21:48,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 21:21:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:48,378 INFO L225 Difference]: With dead ends: 7974 [2019-11-23 21:21:48,379 INFO L226 Difference]: Without dead ends: 3986 [2019-11-23 21:21:48,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:21:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2019-11-23 21:21:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3555. [2019-11-23 21:21:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2019-11-23 21:21:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4345 transitions. [2019-11-23 21:21:48,446 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4345 transitions. Word has length 131 [2019-11-23 21:21:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:48,447 INFO L462 AbstractCegarLoop]: Abstraction has 3555 states and 4345 transitions. [2019-11-23 21:21:48,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:21:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4345 transitions. [2019-11-23 21:21:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 21:21:48,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:48,449 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:48,450 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1672546073, now seen corresponding path program 1 times [2019-11-23 21:21:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:48,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377792742] [2019-11-23 21:21:48,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:21:48,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377792742] [2019-11-23 21:21:48,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081349660] [2019-11-23 21:21:48,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:21:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:48,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:21:48,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:21:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:21:48,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:21:48,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:21:48,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231670378] [2019-11-23 21:21:48,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:21:48,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:21:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:48,789 INFO L87 Difference]: Start difference. First operand 3555 states and 4345 transitions. Second operand 3 states. [2019-11-23 21:21:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:51,778 INFO L93 Difference]: Finished difference Result 7104 states and 8684 transitions. [2019-11-23 21:21:51,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:21:51,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-23 21:21:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:51,802 INFO L225 Difference]: With dead ends: 7104 [2019-11-23 21:21:51,802 INFO L226 Difference]: Without dead ends: 3551 [2019-11-23 21:21:51,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2019-11-23 21:21:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3551. [2019-11-23 21:21:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2019-11-23 21:21:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 4323 transitions. [2019-11-23 21:21:51,909 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 4323 transitions. Word has length 185 [2019-11-23 21:21:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:51,911 INFO L462 AbstractCegarLoop]: Abstraction has 3551 states and 4323 transitions. [2019-11-23 21:21:51,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:21:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 4323 transitions. [2019-11-23 21:21:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 21:21:51,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:51,922 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:52,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:21:52,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1290487306, now seen corresponding path program 1 times [2019-11-23 21:21:52,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:52,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456944717] [2019-11-23 21:21:52,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:21:52,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456944717] [2019-11-23 21:21:52,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:52,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:21:52,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618302953] [2019-11-23 21:21:52,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:21:52,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:21:52,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:52,469 INFO L87 Difference]: Start difference. First operand 3551 states and 4323 transitions. Second operand 4 states. [2019-11-23 21:21:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:56,178 INFO L93 Difference]: Finished difference Result 10080 states and 12603 transitions. [2019-11-23 21:21:56,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:56,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-23 21:21:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:56,205 INFO L225 Difference]: With dead ends: 10080 [2019-11-23 21:21:56,205 INFO L226 Difference]: Without dead ends: 6531 [2019-11-23 21:21:56,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2019-11-23 21:21:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 6106. [2019-11-23 21:21:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6106 states. [2019-11-23 21:21:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6106 states to 6106 states and 7247 transitions. [2019-11-23 21:21:56,319 INFO L78 Accepts]: Start accepts. Automaton has 6106 states and 7247 transitions. Word has length 191 [2019-11-23 21:21:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:56,319 INFO L462 AbstractCegarLoop]: Abstraction has 6106 states and 7247 transitions. [2019-11-23 21:21:56,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6106 states and 7247 transitions. [2019-11-23 21:21:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 21:21:56,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:56,325 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:56,325 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1861125085, now seen corresponding path program 1 times [2019-11-23 21:21:56,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:56,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026730723] [2019-11-23 21:21:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 21:21:56,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026730723] [2019-11-23 21:21:56,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:56,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:21:56,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946974551] [2019-11-23 21:21:56,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:21:56,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:21:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:21:56,617 INFO L87 Difference]: Start difference. First operand 6106 states and 7247 transitions. Second operand 6 states. [2019-11-23 21:22:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:03,973 INFO L93 Difference]: Finished difference Result 23318 states and 27790 transitions. [2019-11-23 21:22:03,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:22:03,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-11-23 21:22:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:04,027 INFO L225 Difference]: With dead ends: 23318 [2019-11-23 21:22:04,027 INFO L226 Difference]: Without dead ends: 15063 [2019-11-23 21:22:04,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:22:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15063 states. [2019-11-23 21:22:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15063 to 8211. [2019-11-23 21:22:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8211 states. [2019-11-23 21:22:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 9666 transitions. [2019-11-23 21:22:04,232 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 9666 transitions. Word has length 252 [2019-11-23 21:22:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:04,233 INFO L462 AbstractCegarLoop]: Abstraction has 8211 states and 9666 transitions. [2019-11-23 21:22:04,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:22:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 9666 transitions. [2019-11-23 21:22:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-23 21:22:04,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:04,240 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:22:04,240 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1540121653, now seen corresponding path program 1 times [2019-11-23 21:22:04,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:04,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125540224] [2019-11-23 21:22:04,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 170 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:22:04,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125540224] [2019-11-23 21:22:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513114977] [2019-11-23 21:22:04,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:22:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:04,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:22:04,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:22:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 178 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:22:04,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:22:04,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-11-23 21:22:04,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231953108] [2019-11-23 21:22:04,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:22:04,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:22:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:22:04,977 INFO L87 Difference]: Start difference. First operand 8211 states and 9666 transitions. Second operand 8 states. [2019-11-23 21:22:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:22,818 INFO L93 Difference]: Finished difference Result 42465 states and 49094 transitions. [2019-11-23 21:22:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:22:22,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 280 [2019-11-23 21:22:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:22,891 INFO L225 Difference]: With dead ends: 42465 [2019-11-23 21:22:22,891 INFO L226 Difference]: Without dead ends: 30002 [2019-11-23 21:22:22,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:22:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30002 states. [2019-11-23 21:22:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30002 to 24400. [2019-11-23 21:22:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24400 states. [2019-11-23 21:22:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24400 states to 24400 states and 28012 transitions. [2019-11-23 21:22:23,424 INFO L78 Accepts]: Start accepts. Automaton has 24400 states and 28012 transitions. Word has length 280 [2019-11-23 21:22:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:23,425 INFO L462 AbstractCegarLoop]: Abstraction has 24400 states and 28012 transitions. [2019-11-23 21:22:23,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:22:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 24400 states and 28012 transitions. [2019-11-23 21:22:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-11-23 21:22:23,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:23,433 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:22:23,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:22:23,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2052661774, now seen corresponding path program 1 times [2019-11-23 21:22:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:23,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82343304] [2019-11-23 21:22:23,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 233 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:22:24,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82343304] [2019-11-23 21:22:24,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162054941] [2019-11-23 21:22:24,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:22:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:24,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:22:24,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:22:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:24,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 233 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:22:25,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:22:25,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-11-23 21:22:25,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319479741] [2019-11-23 21:22:25,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:22:25,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:25,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:22:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:22:25,122 INFO L87 Difference]: Start difference. First operand 24400 states and 28012 transitions. Second operand 8 states. [2019-11-23 21:22:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:30,805 INFO L93 Difference]: Finished difference Result 53054 states and 60608 transitions. [2019-11-23 21:22:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:22:30,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 367 [2019-11-23 21:22:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:30,846 INFO L225 Difference]: With dead ends: 53054 [2019-11-23 21:22:30,846 INFO L226 Difference]: Without dead ends: 29081 [2019-11-23 21:22:30,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:22:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29081 states. [2019-11-23 21:22:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29081 to 29076. [2019-11-23 21:22:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29076 states. [2019-11-23 21:22:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29076 states to 29076 states and 32916 transitions. [2019-11-23 21:22:31,245 INFO L78 Accepts]: Start accepts. Automaton has 29076 states and 32916 transitions. Word has length 367 [2019-11-23 21:22:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:31,246 INFO L462 AbstractCegarLoop]: Abstraction has 29076 states and 32916 transitions. [2019-11-23 21:22:31,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:22:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 29076 states and 32916 transitions. [2019-11-23 21:22:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-23 21:22:31,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:31,259 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:22:31,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:22:31,463 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -455336660, now seen corresponding path program 1 times [2019-11-23 21:22:31,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:31,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494135112] [2019-11-23 21:22:31,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-11-23 21:22:32,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494135112] [2019-11-23 21:22:32,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:22:32,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:22:32,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033387948] [2019-11-23 21:22:32,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:22:32,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:32,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:22:32,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:22:32,105 INFO L87 Difference]: Start difference. First operand 29076 states and 32916 transitions. Second operand 3 states. [2019-11-23 21:22:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:34,778 INFO L93 Difference]: Finished difference Result 70055 states and 80026 transitions. [2019-11-23 21:22:34,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:22:34,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-23 21:22:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:34,828 INFO L225 Difference]: With dead ends: 70055 [2019-11-23 21:22:34,828 INFO L226 Difference]: Without dead ends: 41406 [2019-11-23 21:22:34,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:22:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41406 states. [2019-11-23 21:22:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41406 to 38854. [2019-11-23 21:22:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38854 states. [2019-11-23 21:22:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38854 states to 38854 states and 43137 transitions. [2019-11-23 21:22:35,370 INFO L78 Accepts]: Start accepts. Automaton has 38854 states and 43137 transitions. Word has length 443 [2019-11-23 21:22:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:35,372 INFO L462 AbstractCegarLoop]: Abstraction has 38854 states and 43137 transitions. [2019-11-23 21:22:35,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:22:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38854 states and 43137 transitions. [2019-11-23 21:22:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-23 21:22:35,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:35,383 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:22:35,383 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1284495948, now seen corresponding path program 1 times [2019-11-23 21:22:35,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:35,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146607122] [2019-11-23 21:22:35,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-23 21:22:36,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146607122] [2019-11-23 21:22:36,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:22:36,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:22:36,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092290503] [2019-11-23 21:22:36,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:22:36,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:22:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:22:36,177 INFO L87 Difference]: Start difference. First operand 38854 states and 43137 transitions. Second operand 3 states. [2019-11-23 21:22:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:38,578 INFO L93 Difference]: Finished difference Result 78981 states and 87866 transitions. [2019-11-23 21:22:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:22:38,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-11-23 21:22:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:38,620 INFO L225 Difference]: With dead ends: 78981 [2019-11-23 21:22:38,620 INFO L226 Difference]: Without dead ends: 40979 [2019-11-23 21:22:38,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:22:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40979 states. [2019-11-23 21:22:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40979 to 40554. [2019-11-23 21:22:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40554 states. [2019-11-23 21:22:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40554 states to 40554 states and 44787 transitions. [2019-11-23 21:22:40,312 INFO L78 Accepts]: Start accepts. Automaton has 40554 states and 44787 transitions. Word has length 446 [2019-11-23 21:22:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:40,312 INFO L462 AbstractCegarLoop]: Abstraction has 40554 states and 44787 transitions. [2019-11-23 21:22:40,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:22:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 40554 states and 44787 transitions. [2019-11-23 21:22:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-11-23 21:22:40,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:40,321 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:22:40,321 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash -566529451, now seen corresponding path program 1 times [2019-11-23 21:22:40,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:40,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826643185] [2019-11-23 21:22:40,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 21:22:40,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826643185] [2019-11-23 21:22:40,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:22:40,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:22:40,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21877374] [2019-11-23 21:22:40,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:22:40,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:22:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:22:40,739 INFO L87 Difference]: Start difference. First operand 40554 states and 44787 transitions. Second operand 4 states. [2019-11-23 21:22:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:22:44,583 INFO L93 Difference]: Finished difference Result 92174 states and 102095 transitions. [2019-11-23 21:22:44,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:22:44,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 449 [2019-11-23 21:22:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:22:44,629 INFO L225 Difference]: With dead ends: 92174 [2019-11-23 21:22:44,630 INFO L226 Difference]: Without dead ends: 52045 [2019-11-23 21:22:44,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:22:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52045 states. [2019-11-23 21:22:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52045 to 45653. [2019-11-23 21:22:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45653 states. [2019-11-23 21:22:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45653 states to 45653 states and 49673 transitions. [2019-11-23 21:22:45,059 INFO L78 Accepts]: Start accepts. Automaton has 45653 states and 49673 transitions. Word has length 449 [2019-11-23 21:22:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:22:45,060 INFO L462 AbstractCegarLoop]: Abstraction has 45653 states and 49673 transitions. [2019-11-23 21:22:45,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:22:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45653 states and 49673 transitions. [2019-11-23 21:22:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-11-23 21:22:45,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:22:45,072 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:22:45,072 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:22:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:22:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 67703768, now seen corresponding path program 1 times [2019-11-23 21:22:45,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:22:45,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860665986] [2019-11-23 21:22:45,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:22:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 690 proven. 202 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 21:22:45,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860665986] [2019-11-23 21:22:45,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065534933] [2019-11-23 21:22:45,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:22:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:22:45,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:22:45,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:22:45,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:22:45,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:22:46,244 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 25 [2019-11-23 21:22:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 416 proven. 290 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-23 21:22:46,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:22:46,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-23 21:22:46,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573580181] [2019-11-23 21:22:46,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:22:46,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:22:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:22:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:22:46,953 INFO L87 Difference]: Start difference. First operand 45653 states and 49673 transitions. Second operand 8 states.