java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:41:04,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:41:04,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:41:04,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:41:04,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:41:04,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:41:04,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:41:04,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:41:04,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:41:04,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:41:04,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:41:04,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:41:04,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:41:04,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:41:04,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:41:04,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:41:04,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:41:04,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:41:04,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:41:04,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:41:04,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:41:04,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:41:04,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:41:04,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:41:04,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:41:04,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:41:04,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:41:04,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:41:04,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:41:04,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:41:04,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:41:04,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:41:04,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:41:04,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:41:04,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:41:04,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:41:04,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:41:04,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:41:04,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:41:04,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:41:04,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:41:04,651 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:41:04,680 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:41:04,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:41:04,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:41:04,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:41:04,682 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:41:04,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:41:04,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:41:04,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:41:04,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:41:04,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:41:04,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:41:04,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:41:04,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:41:04,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:41:04,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:41:04,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:41:04,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:41:04,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:41:04,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:41:04,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:41:04,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:41:04,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:41:04,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:41:04,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:41:04,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:41:05,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:41:05,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:41:05,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:41:05,021 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:41:05,022 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum4.c [2019-10-14 21:41:05,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b794281/230cb0839022465287c4292ca71956ba/FLAG3b22be809 [2019-10-14 21:41:05,500 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:41:05,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum4.c [2019-10-14 21:41:05,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b794281/230cb0839022465287c4292ca71956ba/FLAG3b22be809 [2019-10-14 21:41:05,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b794281/230cb0839022465287c4292ca71956ba [2019-10-14 21:41:05,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:41:05,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:41:05,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:41:05,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:41:05,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:41:05,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:05" (1/1) ... [2019-10-14 21:41:05,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67eb3e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:05, skipping insertion in model container [2019-10-14 21:41:05,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:05" (1/1) ... [2019-10-14 21:41:05,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:41:05,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:41:06,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:41:06,148 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:41:06,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:41:06,198 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:41:06,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06 WrapperNode [2019-10-14 21:41:06,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:41:06,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:41:06,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:41:06,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:41:06,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (1/1) ... [2019-10-14 21:41:06,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:41:06,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:41:06,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:41:06,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:41:06,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (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:41:06,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:41:06,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:41:06,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:41:06,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:41:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:41:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:41:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:41:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:41:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:41:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:41:06,740 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:41:06,741 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-14 21:41:06,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:06 BoogieIcfgContainer [2019-10-14 21:41:06,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:41:06,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:41:06,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:41:06,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:41:06,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:41:05" (1/3) ... [2019-10-14 21:41:06,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b79a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:06, skipping insertion in model container [2019-10-14 21:41:06,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:06" (2/3) ... [2019-10-14 21:41:06,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b79a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:06, skipping insertion in model container [2019-10-14 21:41:06,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:06" (3/3) ... [2019-10-14 21:41:06,751 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum4.c [2019-10-14 21:41:06,760 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:41:06,767 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:41:06,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:41:06,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:41:06,802 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:41:06,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:41:06,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:41:06,803 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:41:06,803 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:41:06,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:41:06,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:41:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-14 21:41:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:41:06,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:06,824 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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:41:06,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2099146995, now seen corresponding path program 1 times [2019-10-14 21:41:06,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:06,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031174813] [2019-10-14 21:41:06,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:06,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:06,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,008 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:41:07,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031174813] [2019-10-14 21:41:07,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:41:07,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:41:07,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438934111] [2019-10-14 21:41:07,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:41:07,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:41:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:41:07,035 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-10-14 21:41:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:07,199 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2019-10-14 21:41:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:41:07,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 21:41:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:07,211 INFO L225 Difference]: With dead ends: 83 [2019-10-14 21:41:07,212 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 21:41:07,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:41:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 21:41:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-14 21:41:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 21:41:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-14 21:41:07,254 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2019-10-14 21:41:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:07,255 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-14 21:41:07,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:41:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-14 21:41:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:41:07,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:07,257 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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:41:07,258 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2130853259, now seen corresponding path program 1 times [2019-10-14 21:41:07,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:07,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109020126] [2019-10-14 21:41:07,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,418 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:41:07,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109020126] [2019-10-14 21:41:07,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:41:07,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:41:07,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261701394] [2019-10-14 21:41:07,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:41:07,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:41:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:41:07,422 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2019-10-14 21:41:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:07,627 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-10-14 21:41:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:41:07,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-14 21:41:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:07,629 INFO L225 Difference]: With dead ends: 58 [2019-10-14 21:41:07,630 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 21:41:07,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:41:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 21:41:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-14 21:41:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:41:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-10-14 21:41:07,643 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 28 [2019-10-14 21:41:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:07,643 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-10-14 21:41:07,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:41:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-10-14 21:41:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:41:07,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:07,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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:41:07,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1966572211, now seen corresponding path program 1 times [2019-10-14 21:41:07,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:07,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884620048] [2019-10-14 21:41:07,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:41:07,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884620048] [2019-10-14 21:41:07,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:41:07,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:41:07,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226573306] [2019-10-14 21:41:07,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:41:07,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:41:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:41:07,747 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 4 states. [2019-10-14 21:41:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:07,886 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2019-10-14 21:41:07,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:41:07,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 21:41:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:07,888 INFO L225 Difference]: With dead ends: 99 [2019-10-14 21:41:07,888 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 21:41:07,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:41:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 21:41:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-10-14 21:41:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 21:41:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-10-14 21:41:07,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 30 [2019-10-14 21:41:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:07,899 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-10-14 21:41:07,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:41:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-10-14 21:41:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 21:41:07,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:07,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:07,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:07,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1207168369, now seen corresponding path program 1 times [2019-10-14 21:41:07,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:07,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045741840] [2019-10-14 21:41:07,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:07,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:41:07,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045741840] [2019-10-14 21:41:07,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:41:07,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:41:07,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655537220] [2019-10-14 21:41:07,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:41:07,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:41:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:41:07,991 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 5 states. [2019-10-14 21:41:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:08,171 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2019-10-14 21:41:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:41:08,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-14 21:41:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:08,173 INFO L225 Difference]: With dead ends: 94 [2019-10-14 21:41:08,173 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 21:41:08,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:41:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 21:41:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-10-14 21:41:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 21:41:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-14 21:41:08,189 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2019-10-14 21:41:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:08,190 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-14 21:41:08,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:41:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-14 21:41:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 21:41:08,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:08,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1413365853, now seen corresponding path program 1 times [2019-10-14 21:41:08,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:08,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437571396] [2019-10-14 21:41:08,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:08,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:08,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 21:41:08,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437571396] [2019-10-14 21:41:08,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802443258] [2019-10-14 21:41:08,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 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:41:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:08,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:41:08,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 21:41:08,489 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:08,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-14 21:41:08,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121341220] [2019-10-14 21:41:08,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:41:08,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:41:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:41:08,491 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 7 states. [2019-10-14 21:41:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:08,616 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2019-10-14 21:41:08,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:41:08,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-10-14 21:41:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:08,617 INFO L225 Difference]: With dead ends: 87 [2019-10-14 21:41:08,618 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 21:41:08,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:41:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 21:41:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-14 21:41:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 21:41:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-14 21:41:08,626 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 46 [2019-10-14 21:41:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:08,626 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-14 21:41:08,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:41:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-14 21:41:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 21:41:08,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:08,628 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:08,832 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1166217631, now seen corresponding path program 2 times [2019-10-14 21:41:08,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:08,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950666810] [2019-10-14 21:41:08,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:08,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:08,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 21:41:08,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950666810] [2019-10-14 21:41:08,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545292679] [2019-10-14 21:41:08,936 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:09,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:41:09,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:41:09,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:41:09,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 21:41:09,058 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:09,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-14 21:41:09,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946963206] [2019-10-14 21:41:09,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:41:09,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:41:09,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:41:09,066 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 8 states. [2019-10-14 21:41:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:09,317 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2019-10-14 21:41:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:41:09,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-10-14 21:41:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:09,319 INFO L225 Difference]: With dead ends: 106 [2019-10-14 21:41:09,319 INFO L226 Difference]: Without dead ends: 73 [2019-10-14 21:41:09,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:41:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-14 21:41:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-10-14 21:41:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 21:41:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-10-14 21:41:09,337 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 48 [2019-10-14 21:41:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:09,337 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-10-14 21:41:09,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:41:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-10-14 21:41:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 21:41:09,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:09,343 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:41:09,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:09,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash -419525295, now seen corresponding path program 3 times [2019-10-14 21:41:09,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:09,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185671747] [2019-10-14 21:41:09,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:09,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:09,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:41:10,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185671747] [2019-10-14 21:41:10,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525065882] [2019-10-14 21:41:10,534 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:10,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:41:10,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:41:10,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-14 21:41:10,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:10,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:41:10,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:41:10,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:41:10,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:41:10,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-10-14 21:41:11,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:41:11,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-10-14 21:41:11,762 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-14 21:41:11,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:41:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:11,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:41:11,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:32 [2019-10-14 21:41:11,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:11,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:11,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:41:12,009 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:12,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 36 [2019-10-14 21:41:12,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464045596] [2019-10-14 21:41:12,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 21:41:12,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 21:41:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 21:41:12,011 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 36 states. [2019-10-14 21:41:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:13,732 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2019-10-14 21:41:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-14 21:41:13,738 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 64 [2019-10-14 21:41:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:13,740 INFO L225 Difference]: With dead ends: 174 [2019-10-14 21:41:13,740 INFO L226 Difference]: Without dead ends: 168 [2019-10-14 21:41:13,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 23 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2019-10-14 21:41:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-14 21:41:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 106. [2019-10-14 21:41:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-14 21:41:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2019-10-14 21:41:13,761 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 64 [2019-10-14 21:41:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:13,761 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2019-10-14 21:41:13,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 21:41:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2019-10-14 21:41:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 21:41:13,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:13,763 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-14 21:41:13,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:13,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1580271247, now seen corresponding path program 4 times [2019-10-14 21:41:13,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:13,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348098723] [2019-10-14 21:41:13,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:13,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:13,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 21:41:14,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348098723] [2019-10-14 21:41:14,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953604819] [2019-10-14 21:41:14,070 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:14,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:41:14,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:41:14,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 21:41:14,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 21:41:14,197 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:14,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 21:41:14,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807727496] [2019-10-14 21:41:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:41:14,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:41:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:41:14,203 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 14 states. [2019-10-14 21:41:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:14,624 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2019-10-14 21:41:14,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:41:14,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-10-14 21:41:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:14,627 INFO L225 Difference]: With dead ends: 206 [2019-10-14 21:41:14,627 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 21:41:14,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:41:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 21:41:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-10-14 21:41:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 21:41:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2019-10-14 21:41:14,641 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 66 [2019-10-14 21:41:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:14,641 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2019-10-14 21:41:14,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:41:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2019-10-14 21:41:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-14 21:41:14,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:14,643 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-14 21:41:14,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:14,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1760597427, now seen corresponding path program 5 times [2019-10-14 21:41:14,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:14,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769558484] [2019-10-14 21:41:14,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:14,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:14,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-14 21:41:14,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769558484] [2019-10-14 21:41:14,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708143381] [2019-10-14 21:41:14,960 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:15,075 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 21:41:15,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:41:15,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 21:41:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-14 21:41:15,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:15,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 21:41:15,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764665878] [2019-10-14 21:41:15,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:41:15,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:41:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:41:15,156 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 14 states. [2019-10-14 21:41:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:41:15,577 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2019-10-14 21:41:15,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:41:15,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-10-14 21:41:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:41:15,578 INFO L225 Difference]: With dead ends: 173 [2019-10-14 21:41:15,578 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 21:41:15,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:41:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 21:41:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-10-14 21:41:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-14 21:41:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-10-14 21:41:15,587 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 68 [2019-10-14 21:41:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:41:15,588 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-10-14 21:41:15,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:41:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2019-10-14 21:41:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-14 21:41:15,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:41:15,589 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:41:15,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:41:15,793 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:41:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:41:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1572932479, now seen corresponding path program 6 times [2019-10-14 21:41:15,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:41:15,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601563482] [2019-10-14 21:41:15,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:15,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:41:15,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:41:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:16,702 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2019-10-14 21:41:16,869 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-10-14 21:41:17,032 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2019-10-14 21:41:17,209 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-10-14 21:41:17,355 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2019-10-14 21:41:17,507 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2019-10-14 21:41:17,642 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 27 [2019-10-14 21:41:17,791 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-10-14 21:41:17,955 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2019-10-14 21:41:18,129 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-10-14 21:41:18,314 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2019-10-14 21:41:18,447 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-10-14 21:41:18,724 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2019-10-14 21:41:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:41:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:41:21,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601563482] [2019-10-14 21:41:21,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280674124] [2019-10-14 21:41:21,149 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:21,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-14 21:41:21,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:41:21,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 118 conjunts are in the unsatisfiable core [2019-10-14 21:41:21,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:41:31,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:41:31,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:41:31,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:41:31,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:41:31,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:41:31,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:41:31,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:41:31,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:41:31,302 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-14 21:41:31,302 INFO L341 Elim1Store]: treesize reduction 6, result has 95.6 percent of original size [2019-10-14 21:41:31,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 62 treesize of output 141 [2019-10-14 21:41:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,436 INFO L496 ElimStorePlain]: Start of recursive call 2: 23 dim-0 vars, End of recursive call: 23 dim-0 vars, and 3 xjuncts. [2019-10-14 21:41:31,546 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 29 [2019-10-14 21:41:31,547 INFO L567 ElimStorePlain]: treesize reduction 810, result has 5.0 percent of original size [2019-10-14 21:41:31,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:41:31,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:36 [2019-10-14 21:41:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:31,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:41:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:41:32,118 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:41:32,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 55] total 93 [2019-10-14 21:41:32,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731598893] [2019-10-14 21:41:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-14 21:41:32,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:41:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-14 21:41:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=7813, Unknown=1, NotChecked=0, Total=8556 [2019-10-14 21:41:32,124 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 93 states. [2019-10-14 21:41:35,025 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-14 21:41:42,502 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 68