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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_5.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:45:20,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:45:20,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:45:20,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:45:20,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:45:20,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:45:20,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:45:20,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:45:20,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:45:20,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:45:20,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:45:20,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:45:20,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:45:20,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:45:20,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:45:20,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:45:20,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:45:20,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:45:20,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:45:20,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:45:20,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:45:20,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:45:20,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:45:20,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:45:20,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:45:20,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:45:20,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:45:20,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:45:20,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:45:20,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:45:20,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:45:20,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:45:20,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:45:20,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:45:20,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:45:20,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:45:20,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:45:20,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:45:20,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:45:20,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:45:20,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:45:20,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:45:20,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:45:20,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:45:20,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:45:20,605 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:45:20,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:45:20,606 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:45:20,606 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:45:20,606 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:45:20,606 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:45:20,607 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:45:20,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:45:20,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:45:20,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:45:20,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:45:20,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:45:20,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:45:20,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:45:20,609 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:45:20,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:45:20,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:45:20,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:45:20,610 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:45:20,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:45:20,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:45:20,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:45:20,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:45:20,610 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:45:20,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:45:20,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:45:20,611 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:45:20,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:45:20,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:45:20,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:45:20,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:45:20,677 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:45:20,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5.c.cil.c [2019-09-09 05:45:20,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280b8f498/2e261e45bd36425e82843b5b162d1f70/FLAG8f6a40fdc [2019-09-09 05:45:21,222 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:45:21,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5.c.cil.c [2019-09-09 05:45:21,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280b8f498/2e261e45bd36425e82843b5b162d1f70/FLAG8f6a40fdc [2019-09-09 05:45:21,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280b8f498/2e261e45bd36425e82843b5b162d1f70 [2019-09-09 05:45:21,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:45:21,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:45:21,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:21,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:45:21,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:45:21,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:21" (1/1) ... [2019-09-09 05:45:21,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fabc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:21, skipping insertion in model container [2019-09-09 05:45:21,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:45:21" (1/1) ... [2019-09-09 05:45:21,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:45:21,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:45:21,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:21,890 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:45:22,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:45:22,028 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:45:22,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22 WrapperNode [2019-09-09 05:45:22,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:45:22,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:45:22,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:45:22,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:45:22,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (1/1) ... [2019-09-09 05:45:22,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:45:22,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:45:22,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:45:22,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:45:22,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (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-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2019-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2019-09-09 05:45:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2019-09-09 05:45:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2019-09-09 05:45:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2019-09-09 05:45:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2019-09-09 05:45:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:45:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:45:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:45:22,537 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:45:22,537 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:45:22,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:22 BoogieIcfgContainer [2019-09-09 05:45:22,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:45:22,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:45:22,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:45:22,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:45:22,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:45:21" (1/3) ... [2019-09-09 05:45:22,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537bef5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:22, skipping insertion in model container [2019-09-09 05:45:22,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:45:22" (2/3) ... [2019-09-09 05:45:22,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537bef5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:45:22, skipping insertion in model container [2019-09-09 05:45:22,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:45:22" (3/3) ... [2019-09-09 05:45:22,546 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2019-09-09 05:45:22,556 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:45:22,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:45:22,582 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:45:22,609 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:45:22,609 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:45:22,609 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:45:22,609 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:45:22,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:45:22,610 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:45:22,610 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:45:22,610 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:45:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-09-09 05:45:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:22,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:22,641 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:45:22,643 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1570912407, now seen corresponding path program 1 times [2019-09-09 05:45:22,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:22,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:22,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:22,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:22,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:22,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:22,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:22,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:22,887 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-09-09 05:45:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:22,942 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-09-09 05:45:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:22,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-09 05:45:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:22,959 INFO L225 Difference]: With dead ends: 65 [2019-09-09 05:45:22,960 INFO L226 Difference]: Without dead ends: 52 [2019-09-09 05:45:22,963 INFO L628 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-09-09 05:45:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-09 05:45:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-09 05:45:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-09 05:45:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2019-09-09 05:45:23,011 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2019-09-09 05:45:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:23,013 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2019-09-09 05:45:23,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2019-09-09 05:45:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:23,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:23,017 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:45:23,017 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash -880454641, now seen corresponding path program 1 times [2019-09-09 05:45:23,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:23,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:45:23,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:23,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:23,156 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2019-09-09 05:45:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:23,219 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-09-09 05:45:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:45:23,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-09 05:45:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:23,223 INFO L225 Difference]: With dead ends: 56 [2019-09-09 05:45:23,223 INFO L226 Difference]: Without dead ends: 52 [2019-09-09 05:45:23,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:45:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-09 05:45:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-09 05:45:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-09 05:45:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2019-09-09 05:45:23,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2019-09-09 05:45:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:23,242 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-09-09 05:45:23,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2019-09-09 05:45:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:45:23,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:23,245 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:45:23,245 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1901522995, now seen corresponding path program 1 times [2019-09-09 05:45:23,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:23,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:23,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:23,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:23,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2019-09-09 05:45:23,388 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [138], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:23,426 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:23,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:23,494 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:23,501 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:23,502 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 20 root evaluator evaluations with a maximum evaluation depth of 2. Performed 20 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 23 variables. [2019-09-09 05:45:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:23,506 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:23,559 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2019-09-09 05:45:23,559 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:23,656 INFO L420 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2019-09-09 05:45:23,656 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:23,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:23,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2019-09-09 05:45:23,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:23,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:45:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:45:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:45:23,659 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 11 states. [2019-09-09 05:45:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:24,239 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-09-09 05:45:24,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-09 05:45:24,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-09 05:45:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:24,243 INFO L225 Difference]: With dead ends: 78 [2019-09-09 05:45:24,243 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:45:24,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:45:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-09-09 05:45:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-09 05:45:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-09-09 05:45:24,254 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2019-09-09 05:45:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:24,254 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-09-09 05:45:24,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:45:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2019-09-09 05:45:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:45:24,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:24,258 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:24,258 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash 922622062, now seen corresponding path program 1 times [2019-09-09 05:45:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:24,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:24,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:24,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:24,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:24,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-09 05:45:24,340 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:24,351 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:24,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:24,355 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:24,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:24,362 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 4. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2019-09-09 05:45:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:24,363 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:24,405 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2019-09-09 05:45:24,405 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:24,484 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-09 05:45:24,484 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:24,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:24,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2019-09-09 05:45:24,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:24,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:45:24,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:45:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:45:24,486 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 12 states. [2019-09-09 05:45:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:24,936 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-09-09 05:45:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:45:24,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-09 05:45:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:24,938 INFO L225 Difference]: With dead ends: 75 [2019-09-09 05:45:24,938 INFO L226 Difference]: Without dead ends: 75 [2019-09-09 05:45:24,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:45:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-09 05:45:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2019-09-09 05:45:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-09 05:45:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-09-09 05:45:24,951 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2019-09-09 05:45:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:24,951 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-09-09 05:45:24,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:45:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-09-09 05:45:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:24,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:24,957 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:24,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash -577786995, now seen corresponding path program 1 times [2019-09-09 05:45:24,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:24,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:25,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:25,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:25,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:25,110 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:25,116 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:25,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:25,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:25,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:25,255 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 461 root evaluator evaluations with a maximum evaluation depth of 4. Performed 461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:25,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:25,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:25,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:25,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:25,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-09 05:45:25,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:25,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:45:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 11 [2019-09-09 05:45:25,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:25,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:45:25,467 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 6 states. [2019-09-09 05:45:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:25,514 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2019-09-09 05:45:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:25,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:45:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:25,516 INFO L225 Difference]: With dead ends: 73 [2019-09-09 05:45:25,516 INFO L226 Difference]: Without dead ends: 69 [2019-09-09 05:45:25,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-09 05:45:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-09 05:45:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-09 05:45:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-09-09 05:45:25,535 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 57 [2019-09-09 05:45:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:25,538 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-09-09 05:45:25,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-09-09 05:45:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:25,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:25,539 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:25,540 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:25,540 INFO L82 PathProgramCache]: Analyzing trace with hash -635045297, now seen corresponding path program 1 times [2019-09-09 05:45:25,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:25,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:25,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:25,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:25,657 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [67], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:25,661 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:25,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:25,664 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:25,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:25,745 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 450 root evaluator evaluations with a maximum evaluation depth of 4. Performed 450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:25,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:25,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:25,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:25,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:25,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:25,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:25,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:25,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:45:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 17 [2019-09-09 05:45:26,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:26,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:26,230 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 8 states. [2019-09-09 05:45:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:28,440 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2019-09-09 05:45:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:28,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-09 05:45:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:28,442 INFO L225 Difference]: With dead ends: 96 [2019-09-09 05:45:28,443 INFO L226 Difference]: Without dead ends: 96 [2019-09-09 05:45:28,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-09 05:45:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2019-09-09 05:45:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-09 05:45:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2019-09-09 05:45:28,454 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 57 [2019-09-09 05:45:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:28,454 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-09-09 05:45:28,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2019-09-09 05:45:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:45:28,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:28,460 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:28,461 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1646162547, now seen corresponding path program 1 times [2019-09-09 05:45:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:28,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:28,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:28,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:28,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-09 05:45:28,581 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [69], [73], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:28,586 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:28,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:28,588 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:28,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:28,651 INFO L272 AbstractInterpreter]: Visited 46 different actions 262 times. Merged at 20 different actions 86 times. Never widened. Performed 429 root evaluator evaluations with a maximum evaluation depth of 4. Performed 429 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:28,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:28,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:28,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:28,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:28,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-09 05:45:28,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:28,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:45:28,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:28,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 14 [2019-09-09 05:45:28,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:28,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:45:28,987 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 6 states. [2019-09-09 05:45:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:29,052 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2019-09-09 05:45:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:29,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:45:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:29,054 INFO L225 Difference]: With dead ends: 97 [2019-09-09 05:45:29,054 INFO L226 Difference]: Without dead ends: 87 [2019-09-09 05:45:29,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:45:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-09 05:45:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-09 05:45:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-09 05:45:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-09-09 05:45:29,067 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 57 [2019-09-09 05:45:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:29,068 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-09-09 05:45:29,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-09-09 05:45:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:45:29,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:29,070 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:29,070 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash 232080411, now seen corresponding path program 1 times [2019-09-09 05:45:29,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:29,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:29,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:29,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2019-09-09 05:45:29,168 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:29,173 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:29,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:29,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:29,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:29,233 INFO L272 AbstractInterpreter]: Visited 47 different actions 256 times. Merged at 20 different actions 80 times. Never widened. Performed 512 root evaluator evaluations with a maximum evaluation depth of 6. Performed 512 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 1 different actions. Largest state had 23 variables. [2019-09-09 05:45:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:29,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:29,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:29,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:29,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:29,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-09 05:45:29,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:29,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:45:29,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:29,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 17 [2019-09-09 05:45:29,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:29,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:29,626 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 8 states. [2019-09-09 05:45:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:29,738 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2019-09-09 05:45:29,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:29,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-09 05:45:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:29,740 INFO L225 Difference]: With dead ends: 90 [2019-09-09 05:45:29,740 INFO L226 Difference]: Without dead ends: 85 [2019-09-09 05:45:29,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-09 05:45:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2019-09-09 05:45:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-09 05:45:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-09-09 05:45:29,758 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 58 [2019-09-09 05:45:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:29,758 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-09-09 05:45:29,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-09-09 05:45:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:45:29,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:29,759 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:29,760 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1094827318, now seen corresponding path program 1 times [2019-09-09 05:45:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:29,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:29,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2019-09-09 05:45:29,874 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [29], [35], [44], [48], [54], [60], [62], [63], [64], [67], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:29,877 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:29,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:29,880 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:30,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:30,027 INFO L272 AbstractInterpreter]: Visited 51 different actions 342 times. Merged at 21 different actions 111 times. Never widened. Performed 716 root evaluator evaluations with a maximum evaluation depth of 6. Performed 716 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 2 different actions. Largest state had 23 variables. [2019-09-09 05:45:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:30,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:30,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:30,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:30,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:30,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-09 05:45:30,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:30,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:45:30,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:30,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 9] total 19 [2019-09-09 05:45:30,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:30,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:45:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:45:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:45:30,508 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 13 states. [2019-09-09 05:45:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:31,214 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2019-09-09 05:45:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-09 05:45:31,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-09 05:45:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:31,217 INFO L225 Difference]: With dead ends: 136 [2019-09-09 05:45:31,217 INFO L226 Difference]: Without dead ends: 132 [2019-09-09 05:45:31,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-09-09 05:45:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-09 05:45:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2019-09-09 05:45:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-09 05:45:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-09-09 05:45:31,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 62 [2019-09-09 05:45:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:31,243 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-09-09 05:45:31,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:45:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-09-09 05:45:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:45:31,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:31,244 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:31,245 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2062971430, now seen corresponding path program 1 times [2019-09-09 05:45:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:31,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:31,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:31,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:31,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2019-09-09 05:45:31,324 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [48], [54], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:31,331 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:31,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:31,333 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:31,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:31,390 INFO L272 AbstractInterpreter]: Visited 51 different actions 215 times. Merged at 14 different actions 84 times. Widened at 2 different actions 8 times. Performed 429 root evaluator evaluations with a maximum evaluation depth of 6. Performed 429 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 5 different actions. Largest state had 23 variables. [2019-09-09 05:45:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:31,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:31,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:31,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:31,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:31,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:45:31,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 05:45:31,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:31,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:31,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-09 05:45:31,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:31,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:45:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:45:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:31,613 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 5 states. [2019-09-09 05:45:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:31,673 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2019-09-09 05:45:31,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:31,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:45:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:31,674 INFO L225 Difference]: With dead ends: 117 [2019-09-09 05:45:31,675 INFO L226 Difference]: Without dead ends: 114 [2019-09-09 05:45:31,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-09 05:45:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2019-09-09 05:45:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-09 05:45:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2019-09-09 05:45:31,683 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 63 [2019-09-09 05:45:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:31,683 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2019-09-09 05:45:31,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:45:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2019-09-09 05:45:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:45:31,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:31,685 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:31,685 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 387817051, now seen corresponding path program 1 times [2019-09-09 05:45:31,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:31,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:31,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:31,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2019-09-09 05:45:31,793 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [48], [54], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:31,796 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:31,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:31,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:31,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:31,891 INFO L272 AbstractInterpreter]: Visited 52 different actions 562 times. Merged at 25 different actions 276 times. Widened at 3 different actions 28 times. Performed 1178 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1178 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 42 fixpoints after 7 different actions. Largest state had 23 variables. [2019-09-09 05:45:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:31,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:31,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:31,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-09 05:45:31,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-09 05:45:32,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-09-09 05:45:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:32,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 14] total 26 [2019-09-09 05:45:32,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:32,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:45:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:45:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-09-09 05:45:32,579 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 14 states. [2019-09-09 05:45:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:33,229 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2019-09-09 05:45:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-09 05:45:33,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-09 05:45:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:33,230 INFO L225 Difference]: With dead ends: 143 [2019-09-09 05:45:33,231 INFO L226 Difference]: Without dead ends: 133 [2019-09-09 05:45:33,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2019-09-09 05:45:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-09 05:45:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2019-09-09 05:45:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-09 05:45:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2019-09-09 05:45:33,238 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 65 [2019-09-09 05:45:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:33,238 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2019-09-09 05:45:33,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:45:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2019-09-09 05:45:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:45:33,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:33,239 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:33,239 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1840882449, now seen corresponding path program 1 times [2019-09-09 05:45:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:33,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:33,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:33,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:33,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2019-09-09 05:45:33,288 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [22], [24], [27], [35], [44], [50], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:33,289 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:33,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:33,291 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:33,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:33,351 INFO L272 AbstractInterpreter]: Visited 51 different actions 425 times. Merged at 24 different actions 188 times. Widened at 2 different actions 15 times. Performed 883 root evaluator evaluations with a maximum evaluation depth of 6. Performed 883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 30 fixpoints after 5 different actions. Largest state had 23 variables. [2019-09-09 05:45:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:33,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:33,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:33,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:33,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:33,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-09 05:45:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 05:45:33,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-09 05:45:33,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:33,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:45:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:45:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:33,516 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 6 states. [2019-09-09 05:45:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:33,581 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2019-09-09 05:45:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:33,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-09 05:45:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:33,583 INFO L225 Difference]: With dead ends: 133 [2019-09-09 05:45:33,583 INFO L226 Difference]: Without dead ends: 130 [2019-09-09 05:45:33,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-09 05:45:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2019-09-09 05:45:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-09 05:45:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2019-09-09 05:45:33,591 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 66 [2019-09-09 05:45:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:33,591 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2019-09-09 05:45:33,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:45:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2019-09-09 05:45:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:45:33,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:33,593 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:33,593 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1414595280, now seen corresponding path program 1 times [2019-09-09 05:45:33,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:33,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-09 05:45:33,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:33,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:33,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-09 05:45:33,674 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [9], [18], [24], [27], [29], [35], [44], [50], [60], [62], [63], [64], [69], [75], [78], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [201], [202], [203], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215] [2019-09-09 05:45:33,677 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:33,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:33,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:33,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:33,762 INFO L272 AbstractInterpreter]: Visited 51 different actions 459 times. Merged at 24 different actions 222 times. Widened at 3 different actions 29 times. Performed 995 root evaluator evaluations with a maximum evaluation depth of 6. Performed 995 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 45 fixpoints after 6 different actions. Largest state had 23 variables. [2019-09-09 05:45:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:33,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:33,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:33,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:33,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:33,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:33,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-09 05:45:33,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-09 05:45:34,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-09 05:45:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:34,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2019-09-09 05:45:34,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:34,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:45:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:45:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:34,416 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 14 states. [2019-09-09 05:45:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:35,063 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2019-09-09 05:45:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-09 05:45:35,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-09-09 05:45:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:35,064 INFO L225 Difference]: With dead ends: 137 [2019-09-09 05:45:35,064 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:45:35,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2019-09-09 05:45:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:45:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:45:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:45:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:45:35,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-09-09 05:45:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:35,066 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:45:35,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:45:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:45:35,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:45:35,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:35 BoogieIcfgContainer [2019-09-09 05:45:35,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:35,074 INFO L168 Benchmark]: Toolchain (without parser) took 13486.72 ms. Allocated memory was 133.2 MB in the beginning and 346.6 MB in the end (delta: 213.4 MB). Free memory was 89.3 MB in the beginning and 254.0 MB in the end (delta: -164.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,075 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.01 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 89.1 MB in the beginning and 174.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,076 INFO L168 Benchmark]: Boogie Preprocessor took 38.64 ms. Allocated memory is still 199.8 MB. Free memory was 174.5 MB in the beginning and 172.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,077 INFO L168 Benchmark]: RCFGBuilder took 470.27 ms. Allocated memory is still 199.8 MB. Free memory was 172.6 MB in the beginning and 148.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,078 INFO L168 Benchmark]: TraceAbstraction took 12531.83 ms. Allocated memory was 199.8 MB in the beginning and 346.6 MB in the end (delta: 146.8 MB). Free memory was 148.5 MB in the beginning and 254.0 MB in the end (delta: -105.5 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:35,081 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.01 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 89.1 MB in the beginning and 174.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.64 ms. Allocated memory is still 199.8 MB. Free memory was 174.5 MB in the beginning and 172.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.27 ms. Allocated memory is still 199.8 MB. Free memory was 172.6 MB in the beginning and 148.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12531.83 ms. Allocated memory was 199.8 MB in the beginning and 346.6 MB in the end (delta: 146.8 MB). Free memory was 148.5 MB in the beginning and 254.0 MB in the end (delta: -105.5 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 1 error locations. SAFE Result, 12.4s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 830 SDtfs, 419 SDslu, 4360 SDs, 0 SdLazy, 1354 SolverSat, 56 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1324 GetRequests, 1108 SyntacticMatches, 15 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 11 AbstIntIterations, 2 AbstIntStrong, 0.8666666666666665 AbsIntWeakeningRatio, 1.4854368932038835 AbsIntAvgWeakeningVarsNumRemoved, 0.4563106796116505 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 172 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1309 NumberOfCodeBlocks, 1309 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1831 ConstructedInterpolants, 56 QuantifiedInterpolants, 255918 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 764/1011 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...