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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:06,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:06,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:06,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:06,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:06,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:06,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:06,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:06,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:06,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:06,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:06,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:06,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:06,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:06,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:06,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:06,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:06,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:06,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:06,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:06,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:06,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:06,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:06,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:06,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:06,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:06,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:06,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:06,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:06,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:06,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:06,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:06,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:06,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:06,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:06,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:06,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:06,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:06,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:06,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:06,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:06,581 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-15 01:22:06,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:06,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:06,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:06,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:06,598 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:06,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:06,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:06,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:06,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:06,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:06,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:06,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:06,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:06,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:06,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:06,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:06,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:06,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:06,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:06,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:06,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:06,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:06,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:06,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:06,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:06,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:06,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:06,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:06,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:06,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:06,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:06,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:06,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:06,884 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:06,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-15 01:22:06,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cff76ed0/ab25eadac499419c92673ad7cdb4faf7/FLAG806a54f56 [2019-10-15 01:22:07,483 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:07,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-15 01:22:07,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cff76ed0/ab25eadac499419c92673ad7cdb4faf7/FLAG806a54f56 [2019-10-15 01:22:07,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cff76ed0/ab25eadac499419c92673ad7cdb4faf7 [2019-10-15 01:22:07,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:07,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:07,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:07,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:07,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:07,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:07" (1/1) ... [2019-10-15 01:22:07,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3d015c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:07, skipping insertion in model container [2019-10-15 01:22:07,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:07" (1/1) ... [2019-10-15 01:22:07,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:07,866 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:08,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:08,255 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:08,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:08,371 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:08,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08 WrapperNode [2019-10-15 01:22:08,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:08,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:08,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:08,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:08,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:08,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:08,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:08,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:08,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (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-15 01:22:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:22:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:09,337 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:09,338 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:22:09,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:09 BoogieIcfgContainer [2019-10-15 01:22:09,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:09,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:09,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:09,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:09,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:07" (1/3) ... [2019-10-15 01:22:09,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b25cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:09, skipping insertion in model container [2019-10-15 01:22:09,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08" (2/3) ... [2019-10-15 01:22:09,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b25cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:09, skipping insertion in model container [2019-10-15 01:22:09,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:09" (3/3) ... [2019-10-15 01:22:09,366 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-10-15 01:22:09,377 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:09,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:09,399 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:09,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:09,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:09,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:09,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:09,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:09,439 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:09,439 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:09,439 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-15 01:22:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:22:09,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:09,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:09,481 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash 919157391, now seen corresponding path program 1 times [2019-10-15 01:22:09,497 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:09,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418920877] [2019-10-15 01:22:09,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:09,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:09,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:09,692 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-15 01:22:09,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418920877] [2019-10-15 01:22:09,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:09,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:09,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037766340] [2019-10-15 01:22:09,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:09,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:09,719 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-15 01:22:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:10,135 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2019-10-15 01:22:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:10,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:22:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:10,163 INFO L225 Difference]: With dead ends: 331 [2019-10-15 01:22:10,163 INFO L226 Difference]: Without dead ends: 206 [2019-10-15 01:22:10,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-15 01:22:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-10-15 01:22:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-15 01:22:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-10-15 01:22:10,264 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2019-10-15 01:22:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:10,265 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-10-15 01:22:10,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-10-15 01:22:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:22:10,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 736602936, now seen corresponding path program 1 times [2019-10-15 01:22:10,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772600031] [2019-10-15 01:22:10,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:10,333 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-15 01:22:10,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772600031] [2019-10-15 01:22:10,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:10,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:10,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370519591] [2019-10-15 01:22:10,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:10,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:10,337 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-10-15 01:22:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:10,375 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2019-10-15 01:22:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:10,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-15 01:22:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:10,378 INFO L225 Difference]: With dead ends: 365 [2019-10-15 01:22:10,378 INFO L226 Difference]: Without dead ends: 189 [2019-10-15 01:22:10,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-15 01:22:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-10-15 01:22:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-15 01:22:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-10-15 01:22:10,391 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2019-10-15 01:22:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:10,391 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-10-15 01:22:10,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-10-15 01:22:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:22:10,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,393 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash 816788357, now seen corresponding path program 1 times [2019-10-15 01:22:10,394 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191916850] [2019-10-15 01:22:10,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:10,777 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-10-15 01:22:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:10,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191916850] [2019-10-15 01:22:10,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:10,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:10,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130809382] [2019-10-15 01:22:10,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:10,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:10,784 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 4 states. [2019-10-15 01:22:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,054 INFO L93 Difference]: Finished difference Result 292 states and 485 transitions. [2019-10-15 01:22:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:11,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 01:22:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,057 INFO L225 Difference]: With dead ends: 292 [2019-10-15 01:22:11,057 INFO L226 Difference]: Without dead ends: 276 [2019-10-15 01:22:11,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-15 01:22:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-10-15 01:22:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-15 01:22:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-10-15 01:22:11,071 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2019-10-15 01:22:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,072 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-10-15 01:22:11,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-10-15 01:22:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:22:11,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,074 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] [2019-10-15 01:22:11,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1993084704, now seen corresponding path program 1 times [2019-10-15 01:22:11,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461614556] [2019-10-15 01:22:11,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461614556] [2019-10-15 01:22:11,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559303685] [2019-10-15 01:22:11,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,158 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-10-15 01:22:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,206 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2019-10-15 01:22:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:22:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,209 INFO L225 Difference]: With dead ends: 468 [2019-10-15 01:22:11,209 INFO L226 Difference]: Without dead ends: 216 [2019-10-15 01:22:11,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-15 01:22:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-10-15 01:22:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-15 01:22:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-10-15 01:22:11,220 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2019-10-15 01:22:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,220 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-10-15 01:22:11,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-10-15 01:22:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:22:11,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,222 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash -365898165, now seen corresponding path program 1 times [2019-10-15 01:22:11,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146196212] [2019-10-15 01:22:11,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146196212] [2019-10-15 01:22:11,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842616437] [2019-10-15 01:22:11,276 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-15 01:22:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:22:11,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:22:11,452 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:22:11,499 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:22:11,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:22:11,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028251254] [2019-10-15 01:22:11,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:11,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:22:11,501 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 4 states. [2019-10-15 01:22:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,541 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2019-10-15 01:22:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-15 01:22:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,544 INFO L225 Difference]: With dead ends: 389 [2019-10-15 01:22:11,544 INFO L226 Difference]: Without dead ends: 182 [2019-10-15 01:22:11,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:22:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-15 01:22:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-10-15 01:22:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-15 01:22:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2019-10-15 01:22:11,560 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2019-10-15 01:22:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,560 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2019-10-15 01:22:11,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2019-10-15 01:22:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:22:11,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,566 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:11,771 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1624798356, now seen corresponding path program 1 times [2019-10-15 01:22:11,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478272020] [2019-10-15 01:22:11,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478272020] [2019-10-15 01:22:11,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307171246] [2019-10-15 01:22:11,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:22:11,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1354731528] [2019-10-15 01:22:11,968 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-15 01:22:12,038 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:12,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:12,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:13,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:13,671 INFO L272 AbstractInterpreter]: Visited 26 different actions 75 times. Merged at 18 different actions 40 times. Never widened. Performed 369 root evaluator evaluations with a maximum evaluation depth of 15. Performed 369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-15 01:22:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:13,677 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:13,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:13,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:22:13,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83850387] [2019-10-15 01:22:13,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:22:13,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:22:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:22:13,689 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 6 states. [2019-10-15 01:22:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:13,959 INFO L93 Difference]: Finished difference Result 524 states and 852 transitions. [2019-10-15 01:22:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:22:13,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-15 01:22:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:13,962 INFO L225 Difference]: With dead ends: 524 [2019-10-15 01:22:13,962 INFO L226 Difference]: Without dead ends: 371 [2019-10-15 01:22:13,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:22:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-15 01:22:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 314. [2019-10-15 01:22:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-15 01:22:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 533 transitions. [2019-10-15 01:22:13,975 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 533 transitions. Word has length 30 [2019-10-15 01:22:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:13,976 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 533 transitions. [2019-10-15 01:22:13,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:22:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 533 transitions. [2019-10-15 01:22:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:22:13,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:13,978 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:14,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:14,192 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash -944739986, now seen corresponding path program 1 times [2019-10-15 01:22:14,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:14,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860862405] [2019-10-15 01:22:14,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:14,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860862405] [2019-10-15 01:22:14,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348658861] [2019-10-15 01:22:14,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:14,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:22:14,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:14,332 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:14,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [501952661] [2019-10-15 01:22:14,348 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-15 01:22:14,351 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:14,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:14,366 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:14,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:14,794 INFO L272 AbstractInterpreter]: Visited 25 different actions 52 times. Merged at 16 different actions 22 times. Never widened. Performed 271 root evaluator evaluations with a maximum evaluation depth of 15. Performed 271 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-15 01:22:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:14,795 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:14,796 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:14,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2019-10-15 01:22:14,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707591166] [2019-10-15 01:22:14,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:22:14,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:22:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:14,800 INFO L87 Difference]: Start difference. First operand 314 states and 533 transitions. Second operand 5 states. [2019-10-15 01:22:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:14,955 INFO L93 Difference]: Finished difference Result 602 states and 1030 transitions. [2019-10-15 01:22:14,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:14,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 01:22:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:14,961 INFO L225 Difference]: With dead ends: 602 [2019-10-15 01:22:14,961 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:22:14,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:22:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 576. [2019-10-15 01:22:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:22:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 970 transitions. [2019-10-15 01:22:14,977 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 970 transitions. Word has length 30 [2019-10-15 01:22:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:14,977 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 970 transitions. [2019-10-15 01:22:14,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:22:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 970 transitions. [2019-10-15 01:22:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:22:14,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:14,979 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:15,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:15,183 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 789275061, now seen corresponding path program 1 times [2019-10-15 01:22:15,184 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:15,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757283264] [2019-10-15 01:22:15,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:15,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:15,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:15,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757283264] [2019-10-15 01:22:15,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284970512] [2019-10-15 01:22:15,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:15,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:22:15,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:15,420 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:15,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:15,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1868496574] [2019-10-15 01:22:15,483 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-15 01:22:15,487 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:15,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:15,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:16,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:16,297 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 19 different actions 43 times. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 15. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 40 variables. [2019-10-15 01:22:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:16,298 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:16,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:16,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-10-15 01:22:16,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774713759] [2019-10-15 01:22:16,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:16,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:16,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:16,300 INFO L87 Difference]: Start difference. First operand 576 states and 970 transitions. Second operand 8 states. [2019-10-15 01:22:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:16,568 INFO L93 Difference]: Finished difference Result 755 states and 1253 transitions. [2019-10-15 01:22:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:22:16,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-15 01:22:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:16,573 INFO L225 Difference]: With dead ends: 755 [2019-10-15 01:22:16,573 INFO L226 Difference]: Without dead ends: 738 [2019-10-15 01:22:16,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-15 01:22:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 715. [2019-10-15 01:22:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-15 01:22:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1195 transitions. [2019-10-15 01:22:16,592 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1195 transitions. Word has length 31 [2019-10-15 01:22:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:16,592 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1195 transitions. [2019-10-15 01:22:16,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1195 transitions. [2019-10-15 01:22:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:22:16,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:16,593 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:16,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:16,805 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2038890699, now seen corresponding path program 1 times [2019-10-15 01:22:16,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:16,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256466780] [2019-10-15 01:22:16,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:16,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:16,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:22:16,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256466780] [2019-10-15 01:22:16,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:16,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:16,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911987077] [2019-10-15 01:22:16,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:16,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:16,832 INFO L87 Difference]: Start difference. First operand 715 states and 1195 transitions. Second operand 3 states. [2019-10-15 01:22:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:16,870 INFO L93 Difference]: Finished difference Result 1334 states and 2217 transitions. [2019-10-15 01:22:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:16,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 01:22:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:16,874 INFO L225 Difference]: With dead ends: 1334 [2019-10-15 01:22:16,874 INFO L226 Difference]: Without dead ends: 649 [2019-10-15 01:22:16,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-15 01:22:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-10-15 01:22:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:22:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1050 transitions. [2019-10-15 01:22:16,891 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1050 transitions. Word has length 32 [2019-10-15 01:22:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:16,892 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1050 transitions. [2019-10-15 01:22:16,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1050 transitions. [2019-10-15 01:22:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:22:16,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:16,893 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:16,893 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash 820851006, now seen corresponding path program 1 times [2019-10-15 01:22:16,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:16,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781561114] [2019-10-15 01:22:16,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:16,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:16,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:22:16,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781561114] [2019-10-15 01:22:16,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:16,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:16,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820877052] [2019-10-15 01:22:16,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:16,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:16,942 INFO L87 Difference]: Start difference. First operand 647 states and 1050 transitions. Second operand 3 states. [2019-10-15 01:22:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:16,981 INFO L93 Difference]: Finished difference Result 1247 states and 2037 transitions. [2019-10-15 01:22:16,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:16,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 01:22:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:16,988 INFO L225 Difference]: With dead ends: 1247 [2019-10-15 01:22:16,988 INFO L226 Difference]: Without dead ends: 649 [2019-10-15 01:22:16,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-15 01:22:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-10-15 01:22:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:22:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1042 transitions. [2019-10-15 01:22:17,005 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1042 transitions. Word has length 40 [2019-10-15 01:22:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:17,006 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1042 transitions. [2019-10-15 01:22:17,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1042 transitions. [2019-10-15 01:22:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:22:17,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:17,007 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-15 01:22:17,007 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1867136664, now seen corresponding path program 1 times [2019-10-15 01:22:17,007 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:17,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989117251] [2019-10-15 01:22:17,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:17,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:17,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:17,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989117251] [2019-10-15 01:22:17,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722586996] [2019-10-15 01:22:17,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:22:17,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:17,387 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:17,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1562154130] [2019-10-15 01:22:17,495 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 42 [2019-10-15 01:22:17,502 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:17,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:17,515 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:17,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:17,970 INFO L272 AbstractInterpreter]: Visited 31 different actions 72 times. Merged at 18 different actions 32 times. Never widened. Performed 357 root evaluator evaluations with a maximum evaluation depth of 15. Performed 357 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 8 fixpoints after 5 different actions. Largest state had 41 variables. [2019-10-15 01:22:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:17,971 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:17,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:17,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2019-10-15 01:22:17,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023807652] [2019-10-15 01:22:17,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:22:17,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:22:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:17,974 INFO L87 Difference]: Start difference. First operand 647 states and 1042 transitions. Second operand 9 states. [2019-10-15 01:22:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:18,923 INFO L93 Difference]: Finished difference Result 1548 states and 2456 transitions. [2019-10-15 01:22:18,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:22:18,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-10-15 01:22:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:18,929 INFO L225 Difference]: With dead ends: 1548 [2019-10-15 01:22:18,929 INFO L226 Difference]: Without dead ends: 923 [2019-10-15 01:22:18,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:22:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-10-15 01:22:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 848. [2019-10-15 01:22:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-15 01:22:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1309 transitions. [2019-10-15 01:22:18,957 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1309 transitions. Word has length 41 [2019-10-15 01:22:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:18,958 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1309 transitions. [2019-10-15 01:22:18,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:22:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1309 transitions. [2019-10-15 01:22:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:22:18,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:18,959 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-15 01:22:19,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:19,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2035215205, now seen corresponding path program 1 times [2019-10-15 01:22:19,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:19,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821194389] [2019-10-15 01:22:19,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:19,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:22:19,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821194389] [2019-10-15 01:22:19,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030685403] [2019-10-15 01:22:19,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:19,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:22:19,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:22:19,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:22:19,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1919000753] [2019-10-15 01:22:19,357 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 43 [2019-10-15 01:22:19,359 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:19,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:19,369 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:20,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:20,807 INFO L272 AbstractInterpreter]: Visited 32 different actions 250 times. Merged at 25 different actions 194 times. Widened at 3 different actions 10 times. Performed 1238 root evaluator evaluations with a maximum evaluation depth of 15. Performed 1238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 22 fixpoints after 6 different actions. Largest state had 42 variables. [2019-10-15 01:22:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:20,808 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:20,808 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:20,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-10-15 01:22:20,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045560045] [2019-10-15 01:22:20,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:20,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:20,813 INFO L87 Difference]: Start difference. First operand 848 states and 1309 transitions. Second operand 4 states. [2019-10-15 01:22:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:20,926 INFO L93 Difference]: Finished difference Result 862 states and 1321 transitions. [2019-10-15 01:22:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:20,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-15 01:22:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:20,932 INFO L225 Difference]: With dead ends: 862 [2019-10-15 01:22:20,932 INFO L226 Difference]: Without dead ends: 850 [2019-10-15 01:22:20,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-15 01:22:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2019-10-15 01:22:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-15 01:22:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1283 transitions. [2019-10-15 01:22:20,969 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1283 transitions. Word has length 42 [2019-10-15 01:22:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:20,970 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1283 transitions. [2019-10-15 01:22:20,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1283 transitions. [2019-10-15 01:22:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:22:20,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:20,972 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:21,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:21,181 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1265387988, now seen corresponding path program 1 times [2019-10-15 01:22:21,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:21,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431199977] [2019-10-15 01:22:21,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:21,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:21,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431199977] [2019-10-15 01:22:21,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249270776] [2019-10-15 01:22:21,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:21,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 01:22:21,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,507 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:21,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:21,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:21,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:21,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1562916002] [2019-10-15 01:22:21,924 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-10-15 01:22:21,927 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:21,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:21,939 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:24,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:24,881 INFO L272 AbstractInterpreter]: Visited 34 different actions 184 times. Merged at 27 different actions 133 times. Widened at 2 different actions 5 times. Performed 958 root evaluator evaluations with a maximum evaluation depth of 15. Performed 958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 16 fixpoints after 7 different actions. Largest state had 44 variables. [2019-10-15 01:22:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:24,881 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:24,881 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:24,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-15 01:22:24,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366466671] [2019-10-15 01:22:24,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:24,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:24,883 INFO L87 Difference]: Start difference. First operand 848 states and 1283 transitions. Second operand 8 states. [2019-10-15 01:22:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:25,103 INFO L93 Difference]: Finished difference Result 859 states and 1291 transitions. [2019-10-15 01:22:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:22:25,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-15 01:22:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:25,108 INFO L225 Difference]: With dead ends: 859 [2019-10-15 01:22:25,108 INFO L226 Difference]: Without dead ends: 857 [2019-10-15 01:22:25,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-10-15 01:22:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 849. [2019-10-15 01:22:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-10-15 01:22:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1284 transitions. [2019-10-15 01:22:25,147 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1284 transitions. Word has length 44 [2019-10-15 01:22:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:25,148 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1284 transitions. [2019-10-15 01:22:25,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1284 transitions. [2019-10-15 01:22:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:22:25,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:25,149 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:25,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:25,353 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:25,354 INFO L82 PathProgramCache]: Analyzing trace with hash -447084202, now seen corresponding path program 1 times [2019-10-15 01:22:25,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:25,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563576245] [2019-10-15 01:22:25,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:22:25,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563576245] [2019-10-15 01:22:25,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:25,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:25,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561561924] [2019-10-15 01:22:25,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:25,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:25,386 INFO L87 Difference]: Start difference. First operand 849 states and 1284 transitions. Second operand 3 states. [2019-10-15 01:22:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:25,424 INFO L93 Difference]: Finished difference Result 1689 states and 2535 transitions. [2019-10-15 01:22:25,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:25,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 01:22:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:25,429 INFO L225 Difference]: With dead ends: 1689 [2019-10-15 01:22:25,429 INFO L226 Difference]: Without dead ends: 889 [2019-10-15 01:22:25,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-15 01:22:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2019-10-15 01:22:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-10-15 01:22:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1303 transitions. [2019-10-15 01:22:25,457 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1303 transitions. Word has length 45 [2019-10-15 01:22:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:25,458 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1303 transitions. [2019-10-15 01:22:25,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1303 transitions. [2019-10-15 01:22:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:22:25,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:25,459 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2019-10-15 01:22:25,459 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 810326805, now seen corresponding path program 1 times [2019-10-15 01:22:25,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:25,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117815763] [2019-10-15 01:22:25,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:22:25,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117815763] [2019-10-15 01:22:25,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:25,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:25,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787569348] [2019-10-15 01:22:25,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:25,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:25,497 INFO L87 Difference]: Start difference. First operand 887 states and 1303 transitions. Second operand 3 states. [2019-10-15 01:22:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:25,530 INFO L93 Difference]: Finished difference Result 1297 states and 1904 transitions. [2019-10-15 01:22:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:25,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 01:22:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:25,533 INFO L225 Difference]: With dead ends: 1297 [2019-10-15 01:22:25,533 INFO L226 Difference]: Without dead ends: 479 [2019-10-15 01:22:25,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-15 01:22:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2019-10-15 01:22:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 01:22:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 686 transitions. [2019-10-15 01:22:25,549 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 686 transitions. Word has length 57 [2019-10-15 01:22:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:25,549 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 686 transitions. [2019-10-15 01:22:25,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 686 transitions. [2019-10-15 01:22:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:22:25,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:25,550 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:25,551 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash 933833257, now seen corresponding path program 1 times [2019-10-15 01:22:25,551 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:25,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36316323] [2019-10-15 01:22:25,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,552 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:25,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:25,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36316323] [2019-10-15 01:22:25,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395647442] [2019-10-15 01:22:25,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:22:25,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:25,948 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:25,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:26,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:22:26,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-15 01:22:26,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787009825] [2019-10-15 01:22:26,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:22:26,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:22:26,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:22:26,048 INFO L87 Difference]: Start difference. First operand 477 states and 686 transitions. Second operand 5 states. [2019-10-15 01:22:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:26,143 INFO L93 Difference]: Finished difference Result 606 states and 867 transitions. [2019-10-15 01:22:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:26,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 01:22:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:26,148 INFO L225 Difference]: With dead ends: 606 [2019-10-15 01:22:26,148 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 01:22:26,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:22:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 01:22:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-10-15 01:22:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:22:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 859 transitions. [2019-10-15 01:22:26,174 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 859 transitions. Word has length 59 [2019-10-15 01:22:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:26,175 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 859 transitions. [2019-10-15 01:22:26,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:22:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 859 transitions. [2019-10-15 01:22:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:22:26,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:26,176 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:26,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:26,380 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1104488738, now seen corresponding path program 1 times [2019-10-15 01:22:26,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:26,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089912204] [2019-10-15 01:22:26,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:26,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:26,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:26,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089912204] [2019-10-15 01:22:26,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458956776] [2019-10-15 01:22:26,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:26,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-15 01:22:26,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:26,695 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:26,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1544642244] [2019-10-15 01:22:26,814 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 61 [2019-10-15 01:22:26,817 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:26,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:26,824 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:32,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:32,246 INFO L272 AbstractInterpreter]: Visited 44 different actions 226 times. Merged at 37 different actions 155 times. Widened at 2 different actions 5 times. Performed 925 root evaluator evaluations with a maximum evaluation depth of 17. Performed 925 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 24 fixpoints after 10 different actions. Largest state had 50 variables. [2019-10-15 01:22:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:32,246 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:32,247 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:32,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-10-15 01:22:32,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492591605] [2019-10-15 01:22:32,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:22:32,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:32,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:22:32,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:22:32,248 INFO L87 Difference]: Start difference. First operand 598 states and 859 transitions. Second operand 13 states. [2019-10-15 01:22:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:32,510 INFO L93 Difference]: Finished difference Result 608 states and 864 transitions. [2019-10-15 01:22:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:22:32,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-10-15 01:22:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:32,514 INFO L225 Difference]: With dead ends: 608 [2019-10-15 01:22:32,515 INFO L226 Difference]: Without dead ends: 606 [2019-10-15 01:22:32,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:22:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-15 01:22:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-10-15 01:22:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:22:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 856 transitions. [2019-10-15 01:22:32,533 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 856 transitions. Word has length 60 [2019-10-15 01:22:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:32,534 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 856 transitions. [2019-10-15 01:22:32,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:22:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 856 transitions. [2019-10-15 01:22:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:22:32,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:32,535 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:32,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:32,748 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 855434068, now seen corresponding path program 1 times [2019-10-15 01:22:32,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:32,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425980070] [2019-10-15 01:22:32,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:32,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:33,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425980070] [2019-10-15 01:22:33,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409645237] [2019-10-15 01:22:33,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:33,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-15 01:22:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:33,237 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:33,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:33,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:22:33,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [87466797] [2019-10-15 01:22:33,438 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 68 [2019-10-15 01:22:33,447 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:33,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:33,461 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:42,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:42,381 INFO L272 AbstractInterpreter]: Visited 45 different actions 204 times. Merged at 37 different actions 134 times. Widened at 3 different actions 6 times. Performed 991 root evaluator evaluations with a maximum evaluation depth of 17. Performed 991 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 23 fixpoints after 11 different actions. Largest state had 50 variables. [2019-10-15 01:22:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,381 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:42,381 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:42,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2019-10-15 01:22:42,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060668409] [2019-10-15 01:22:42,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:22:42,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:42,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:22:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:22:42,383 INFO L87 Difference]: Start difference. First operand 598 states and 856 transitions. Second operand 15 states. [2019-10-15 01:22:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,337 INFO L93 Difference]: Finished difference Result 664 states and 913 transitions. [2019-10-15 01:22:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-15 01:22:43,340 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-10-15 01:22:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,343 INFO L225 Difference]: With dead ends: 664 [2019-10-15 01:22:43,343 INFO L226 Difference]: Without dead ends: 662 [2019-10-15 01:22:43,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:22:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-15 01:22:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 598. [2019-10-15 01:22:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:22:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 849 transitions. [2019-10-15 01:22:43,366 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 849 transitions. Word has length 67 [2019-10-15 01:22:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,366 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 849 transitions. [2019-10-15 01:22:43,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:22:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 849 transitions. [2019-10-15 01:22:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:22:43,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,371 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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] [2019-10-15 01:22:43,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:43,576 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1100197245, now seen corresponding path program 1 times [2019-10-15 01:22:43,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233173731] [2019-10-15 01:22:43,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233173731] [2019-10-15 01:22:43,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973269405] [2019-10-15 01:22:43,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-15 01:22:43,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:22:44,065 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:44,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:22:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:45,697 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-10-15 01:22:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:22:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 67 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:22:45,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1716344257] [2019-10-15 01:22:45,923 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 91 [2019-10-15 01:22:45,929 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:45,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:45,939 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.