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/eca-rers2012/Problem10_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:57:54,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:57:54,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:57:54,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:57:54,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:57:54,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:57:54,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:57:54,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:57:54,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:57:54,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:57:54,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:57:54,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:57:54,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:57:54,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:57:54,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:57:54,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:57:54,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:57:54,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:57:54,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:57:54,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:57:54,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:57:54,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:57:54,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:57:54,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:57:54,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:57:54,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:57:54,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:57:54,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:57:54,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:57:54,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:57:54,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:57:54,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:57:54,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:57:54,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:57:54,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:57:54,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:57:54,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:57:54,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:57:54,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:57:54,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:57:54,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:57:54,780 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-10-14 21:57:54,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:57:54,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:57:54,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:57:54,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:57:54,806 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:57:54,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:57:54,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:57:54,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:57:54,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:57:54,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:57:54,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:57:54,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:57:54,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:57:54,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:57:54,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:57:54,809 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:57:54,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:57:54,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:57:54,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:57:54,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:57:54,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:57:54,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:57:54,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:57:54,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:57:54,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:57:54,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:57:54,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:57:54,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:57:54,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:57:55,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:57:55,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:57:55,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:57:55,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:57:55,108 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:57:55,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-10-14 21:57:55,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b294827/ad3cd2749dbf4680a2239e5b8673df4a/FLAGb64a7928f [2019-10-14 21:57:55,739 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:57:55,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-10-14 21:57:55,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b294827/ad3cd2749dbf4680a2239e5b8673df4a/FLAGb64a7928f [2019-10-14 21:57:55,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b294827/ad3cd2749dbf4680a2239e5b8673df4a [2019-10-14 21:57:56,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:57:56,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:57:56,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:57:56,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:57:56,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:57:56,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:57:55" (1/1) ... [2019-10-14 21:57:56,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2022d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56, skipping insertion in model container [2019-10-14 21:57:56,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:57:55" (1/1) ... [2019-10-14 21:57:56,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:57:56,080 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:57:56,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:57:56,486 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:57:56,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:57:56,795 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:57:56,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56 WrapperNode [2019-10-14 21:57:56,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:57:56,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:57:56,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:57:56,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:57:56,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (1/1) ... [2019-10-14 21:57:56,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:57:56,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:57:56,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:57:56,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:57:56,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (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-10-14 21:57:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:57:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:57:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 21:57:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:57:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:57:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:57:58,238 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:57:58,238 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 21:57:58,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:57:58 BoogieIcfgContainer [2019-10-14 21:57:58,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:57:58,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:57:58,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:57:58,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:57:58,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:57:55" (1/3) ... [2019-10-14 21:57:58,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d408a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:57:58, skipping insertion in model container [2019-10-14 21:57:58,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:57:56" (2/3) ... [2019-10-14 21:57:58,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d408a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:57:58, skipping insertion in model container [2019-10-14 21:57:58,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:57:58" (3/3) ... [2019-10-14 21:57:58,249 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2019-10-14 21:57:58,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:57:58,268 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:57:58,279 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:57:58,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:57:58,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:57:58,313 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:57:58,313 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:57:58,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:57:58,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:57:58,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:57:58,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:57:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-14 21:57:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 21:57:58,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:57:58,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:57:58,349 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:57:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:57:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash 397772918, now seen corresponding path program 1 times [2019-10-14 21:57:58,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:57:58,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654000983] [2019-10-14 21:57:58,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:57:58,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:57:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:57:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:57:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:57:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:57:58,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654000983] [2019-10-14 21:57:58,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:57:58,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:57:58,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813622543] [2019-10-14 21:57:58,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:57:58,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:57:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:57:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:57:58,673 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2019-10-14 21:58:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:00,760 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2019-10-14 21:58:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:58:00,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 21:58:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:00,779 INFO L225 Difference]: With dead ends: 730 [2019-10-14 21:58:00,780 INFO L226 Difference]: Without dead ends: 447 [2019-10-14 21:58:00,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:58:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-14 21:58:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2019-10-14 21:58:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-14 21:58:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2019-10-14 21:58:00,877 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 15 [2019-10-14 21:58:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:00,877 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2019-10-14 21:58:00,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:58:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2019-10-14 21:58:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-14 21:58:00,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:00,882 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:58:00,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1068134291, now seen corresponding path program 1 times [2019-10-14 21:58:00,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:00,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755155789] [2019-10-14 21:58:00,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:00,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:00,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:01,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755155789] [2019-10-14 21:58:01,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:58:01,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 21:58:01,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522327008] [2019-10-14 21:58:01,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:58:01,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:58:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:58:01,201 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 9 states. [2019-10-14 21:58:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:02,743 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2019-10-14 21:58:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 21:58:02,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-14 21:58:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:02,749 INFO L225 Difference]: With dead ends: 1041 [2019-10-14 21:58:02,749 INFO L226 Difference]: Without dead ends: 606 [2019-10-14 21:58:02,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:58:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-14 21:58:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2019-10-14 21:58:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-14 21:58:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2019-10-14 21:58:02,800 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 88 [2019-10-14 21:58:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:02,802 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2019-10-14 21:58:02,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:58:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2019-10-14 21:58:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-14 21:58:02,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:02,808 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:58:02,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1363459929, now seen corresponding path program 1 times [2019-10-14 21:58:02,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:02,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803396307] [2019-10-14 21:58:02,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:02,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:02,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:03,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803396307] [2019-10-14 21:58:03,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140879438] [2019-10-14 21:58:03,032 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-10-14 21:58:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:03,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:58:03,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:03,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:58:03,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-14 21:58:03,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957949382] [2019-10-14 21:58:03,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:58:03,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:58:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:58:03,194 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 3 states. [2019-10-14 21:58:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:03,768 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2019-10-14 21:58:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:58:03,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-14 21:58:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:03,775 INFO L225 Difference]: With dead ends: 1615 [2019-10-14 21:58:03,775 INFO L226 Difference]: Without dead ends: 1029 [2019-10-14 21:58:03,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:58:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-14 21:58:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2019-10-14 21:58:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-14 21:58:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2019-10-14 21:58:03,814 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 94 [2019-10-14 21:58:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:03,815 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2019-10-14 21:58:03,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:58:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2019-10-14 21:58:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-14 21:58:03,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:03,820 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 21:58:04,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:04,026 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -396385674, now seen corresponding path program 1 times [2019-10-14 21:58:04,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:04,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655773438] [2019-10-14 21:58:04,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:04,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:04,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:04,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655773438] [2019-10-14 21:58:04,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:58:04,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 21:58:04,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954443816] [2019-10-14 21:58:04,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:58:04,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:58:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:58:04,391 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand 9 states. [2019-10-14 21:58:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:06,190 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2019-10-14 21:58:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:58:06,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-14 21:58:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:06,199 INFO L225 Difference]: With dead ends: 2245 [2019-10-14 21:58:06,199 INFO L226 Difference]: Without dead ends: 1365 [2019-10-14 21:58:06,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:58:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-10-14 21:58:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2019-10-14 21:58:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-14 21:58:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1317 transitions. [2019-10-14 21:58:06,246 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1317 transitions. Word has length 151 [2019-10-14 21:58:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:06,247 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1317 transitions. [2019-10-14 21:58:06,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:58:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1317 transitions. [2019-10-14 21:58:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-14 21:58:06,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:06,251 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-10-14 21:58:06,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1385846678, now seen corresponding path program 1 times [2019-10-14 21:58:06,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:06,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224853651] [2019-10-14 21:58:06,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:06,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:58:06,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224853651] [2019-10-14 21:58:06,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3805102] [2019-10-14 21:58:06,521 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-10-14 21:58:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:06,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:58:06,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:06,679 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:58:06,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-14 21:58:06,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614529491] [2019-10-14 21:58:06,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:58:06,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:58:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:58:06,682 INFO L87 Difference]: Start difference. First operand 1057 states and 1317 transitions. Second operand 11 states. [2019-10-14 21:58:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:09,568 INFO L93 Difference]: Finished difference Result 2933 states and 4043 transitions. [2019-10-14 21:58:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:58:09,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-14 21:58:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:09,582 INFO L225 Difference]: With dead ends: 2933 [2019-10-14 21:58:09,582 INFO L226 Difference]: Without dead ends: 1882 [2019-10-14 21:58:09,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:58:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-14 21:58:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1548. [2019-10-14 21:58:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-14 21:58:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1966 transitions. [2019-10-14 21:58:09,655 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1966 transitions. Word has length 175 [2019-10-14 21:58:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:09,656 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 1966 transitions. [2019-10-14 21:58:09,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:58:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1966 transitions. [2019-10-14 21:58:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 21:58:09,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:09,660 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-14 21:58:09,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:09,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2064509357, now seen corresponding path program 1 times [2019-10-14 21:58:09,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:09,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973904805] [2019-10-14 21:58:09,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:09,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-14 21:58:10,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973904805] [2019-10-14 21:58:10,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027479481] [2019-10-14 21:58:10,207 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-10-14 21:58:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:10,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:58:10,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 21:58:10,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:58:10,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-14 21:58:10,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813756850] [2019-10-14 21:58:10,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:58:10,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:58:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:58:10,331 INFO L87 Difference]: Start difference. First operand 1548 states and 1966 transitions. Second operand 3 states. [2019-10-14 21:58:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:10,875 INFO L93 Difference]: Finished difference Result 3237 states and 4164 transitions. [2019-10-14 21:58:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:58:10,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-14 21:58:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:10,886 INFO L225 Difference]: With dead ends: 3237 [2019-10-14 21:58:10,886 INFO L226 Difference]: Without dead ends: 1695 [2019-10-14 21:58:10,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:58:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-10-14 21:58:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1544. [2019-10-14 21:58:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-14 21:58:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1916 transitions. [2019-10-14 21:58:10,950 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1916 transitions. Word has length 192 [2019-10-14 21:58:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:10,951 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1916 transitions. [2019-10-14 21:58:10,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:58:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1916 transitions. [2019-10-14 21:58:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-14 21:58:10,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:10,957 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-14 21:58:11,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:11,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 539367001, now seen corresponding path program 1 times [2019-10-14 21:58:11,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:11,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111156357] [2019-10-14 21:58:11,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:11,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:11,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:58:11,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111156357] [2019-10-14 21:58:11,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645326550] [2019-10-14 21:58:11,759 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-10-14 21:58:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:11,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:58:11,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:12,026 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:58:12,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-10-14 21:58:12,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176155210] [2019-10-14 21:58:12,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 21:58:12,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 21:58:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:58:12,031 INFO L87 Difference]: Start difference. First operand 1544 states and 1916 transitions. Second operand 13 states. [2019-10-14 21:58:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:15,623 INFO L93 Difference]: Finished difference Result 4866 states and 6072 transitions. [2019-10-14 21:58:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 21:58:15,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-14 21:58:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:15,635 INFO L225 Difference]: With dead ends: 4866 [2019-10-14 21:58:15,635 INFO L226 Difference]: Without dead ends: 1977 [2019-10-14 21:58:15,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2019-10-14 21:58:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-14 21:58:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1524. [2019-10-14 21:58:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-10-14 21:58:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1757 transitions. [2019-10-14 21:58:15,699 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1757 transitions. Word has length 230 [2019-10-14 21:58:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:15,700 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 1757 transitions. [2019-10-14 21:58:15,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 21:58:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1757 transitions. [2019-10-14 21:58:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-14 21:58:15,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:15,706 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-14 21:58:15,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:15,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1113807393, now seen corresponding path program 1 times [2019-10-14 21:58:15,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:15,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315731475] [2019-10-14 21:58:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:15,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:58:16,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315731475] [2019-10-14 21:58:16,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270729760] [2019-10-14 21:58:16,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:16,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:58:16,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:58:16,594 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:58:16,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-14 21:58:16,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205014693] [2019-10-14 21:58:16,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 21:58:16,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 21:58:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:58:16,597 INFO L87 Difference]: Start difference. First operand 1524 states and 1757 transitions. Second operand 11 states. [2019-10-14 21:58:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:18,423 INFO L93 Difference]: Finished difference Result 2738 states and 3125 transitions. [2019-10-14 21:58:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 21:58:18,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-10-14 21:58:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:18,430 INFO L225 Difference]: With dead ends: 2738 [2019-10-14 21:58:18,430 INFO L226 Difference]: Without dead ends: 1363 [2019-10-14 21:58:18,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:58:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-10-14 21:58:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1198. [2019-10-14 21:58:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-14 21:58:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1300 transitions. [2019-10-14 21:58:18,462 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1300 transitions. Word has length 234 [2019-10-14 21:58:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:18,463 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1300 transitions. [2019-10-14 21:58:18,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 21:58:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1300 transitions. [2019-10-14 21:58:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-14 21:58:18,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:18,468 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-14 21:58:18,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:18,678 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1472473771, now seen corresponding path program 1 times [2019-10-14 21:58:18,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:18,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127263818] [2019-10-14 21:58:18,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:18,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:18,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:58:19,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127263818] [2019-10-14 21:58:19,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909923014] [2019-10-14 21:58:19,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-14 21:58:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:58:19,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 21:58:19,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:58:19,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-10-14 21:58:19,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476394588] [2019-10-14 21:58:19,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:58:19,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:58:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:58:19,301 INFO L87 Difference]: Start difference. First operand 1198 states and 1300 transitions. Second operand 5 states. [2019-10-14 21:58:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:20,076 INFO L93 Difference]: Finished difference Result 2561 states and 2778 transitions. [2019-10-14 21:58:20,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:58:20,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-10-14 21:58:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:20,083 INFO L225 Difference]: With dead ends: 2561 [2019-10-14 21:58:20,083 INFO L226 Difference]: Without dead ends: 1369 [2019-10-14 21:58:20,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:58:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-10-14 21:58:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1345. [2019-10-14 21:58:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-10-14 21:58:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1454 transitions. [2019-10-14 21:58:20,116 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1454 transitions. Word has length 244 [2019-10-14 21:58:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:20,117 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1454 transitions. [2019-10-14 21:58:20,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:58:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1454 transitions. [2019-10-14 21:58:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-14 21:58:20,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:20,122 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:58:20,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:20,333 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash -744935455, now seen corresponding path program 1 times [2019-10-14 21:58:20,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:20,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380524859] [2019-10-14 21:58:20,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:20,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:20,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-14 21:58:20,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380524859] [2019-10-14 21:58:20,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6061766] [2019-10-14 21:58:20,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:20,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 21:58:20,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:20,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 21:58:20,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:58:20,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-10-14 21:58:20,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398447159] [2019-10-14 21:58:20,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:58:20,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:58:20,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:58:20,889 INFO L87 Difference]: Start difference. First operand 1345 states and 1454 transitions. Second operand 3 states. [2019-10-14 21:58:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:21,444 INFO L93 Difference]: Finished difference Result 3115 states and 3396 transitions. [2019-10-14 21:58:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:58:21,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-10-14 21:58:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:21,455 INFO L225 Difference]: With dead ends: 3115 [2019-10-14 21:58:21,455 INFO L226 Difference]: Without dead ends: 1774 [2019-10-14 21:58:21,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:58:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-10-14 21:58:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1486. [2019-10-14 21:58:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-10-14 21:58:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1600 transitions. [2019-10-14 21:58:21,492 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1600 transitions. Word has length 266 [2019-10-14 21:58:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:21,493 INFO L462 AbstractCegarLoop]: Abstraction has 1486 states and 1600 transitions. [2019-10-14 21:58:21,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:58:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1600 transitions. [2019-10-14 21:58:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-14 21:58:21,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:21,498 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-14 21:58:21,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:21,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1813224930, now seen corresponding path program 1 times [2019-10-14 21:58:21,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:21,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481680994] [2019-10-14 21:58:21,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:21,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-14 21:58:21,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481680994] [2019-10-14 21:58:21,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428921773] [2019-10-14 21:58:21,917 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-10-14 21:58:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:22,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 21:58:22,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:22,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:58:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-14 21:58:22,147 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:58:22,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-14 21:58:22,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593353467] [2019-10-14 21:58:22,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 21:58:22,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:58:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 21:58:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:58:22,149 INFO L87 Difference]: Start difference. First operand 1486 states and 1600 transitions. Second operand 9 states. [2019-10-14 21:58:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:58:24,903 INFO L93 Difference]: Finished difference Result 4619 states and 5207 transitions. [2019-10-14 21:58:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:58:24,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 275 [2019-10-14 21:58:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:58:24,917 INFO L225 Difference]: With dead ends: 4619 [2019-10-14 21:58:24,917 INFO L226 Difference]: Without dead ends: 3135 [2019-10-14 21:58:24,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:58:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-10-14 21:58:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2944. [2019-10-14 21:58:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-10-14 21:58:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3193 transitions. [2019-10-14 21:58:25,001 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3193 transitions. Word has length 275 [2019-10-14 21:58:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:58:25,002 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 3193 transitions. [2019-10-14 21:58:25,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 21:58:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3193 transitions. [2019-10-14 21:58:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-10-14 21:58:25,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:58:25,019 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:58:25,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:25,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:58:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:58:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1033916999, now seen corresponding path program 1 times [2019-10-14 21:58:25,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:58:25,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204704304] [2019-10-14 21:58:25,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:25,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:58:25,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:58:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-14 21:58:25,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204704304] [2019-10-14 21:58:25,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113419939] [2019-10-14 21:58:25,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:58:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:58:26,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:58:26,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:58:26,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:58:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms