java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label42_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 21:05:10,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 21:05:10,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 21:05:10,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 21:05:10,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 21:05:10,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 21:05:10,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 21:05:10,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 21:05:10,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 21:05:10,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 21:05:10,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 21:05:10,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 21:05:10,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 21:05:10,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 21:05:10,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 21:05:10,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 21:05:10,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 21:05:10,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 21:05:10,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 21:05:10,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 21:05:10,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 21:05:10,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 21:05:10,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 21:05:10,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 21:05:10,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 21:05:10,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 21:05:10,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 21:05:10,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 21:05:10,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 21:05:10,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 21:05:10,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 21:05:10,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 21:05:10,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 21:05:10,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 21:05:10,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 21:05:10,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 21:05:10,677 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 21:05:10,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 21:05:10,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 21:05:10,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 21:05:10,707 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 21:05:10,707 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 21:05:10,708 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 21:05:10,708 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 21:05:10,708 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 21:05:10,708 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 21:05:10,708 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 21:05:10,709 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 21:05:10,709 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 21:05:10,709 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 21:05:10,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 21:05:10,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 21:05:10,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 21:05:10,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 21:05:10,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 21:05:10,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 21:05:10,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 21:05:10,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 21:05:10,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 21:05:10,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 21:05:10,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 21:05:10,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 21:05:10,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 21:05:10,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 21:05:10,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 21:05:10,713 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 21:05:10,713 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 21:05:10,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 21:05:10,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 21:05:10,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 21:05:10,714 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 21:05:10,714 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 21:05:10,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 21:05:10,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 21:05:10,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 21:05:10,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 21:05:10,793 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 21:05:10,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label42_true-unreach-call.c [2018-11-07 21:05:10,861 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491553d26/78422954e0484e1f95f0f3df34f3b41c/FLAGb246a17e6 [2018-11-07 21:05:11,522 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 21:05:11,523 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label42_true-unreach-call.c [2018-11-07 21:05:11,553 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491553d26/78422954e0484e1f95f0f3df34f3b41c/FLAGb246a17e6 [2018-11-07 21:05:11,575 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491553d26/78422954e0484e1f95f0f3df34f3b41c [2018-11-07 21:05:11,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 21:05:11,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 21:05:11,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 21:05:11,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 21:05:11,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 21:05:11,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:05:11" (1/1) ... [2018-11-07 21:05:11,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b815c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:11, skipping insertion in model container [2018-11-07 21:05:11,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:05:11" (1/1) ... [2018-11-07 21:05:11,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 21:05:11,736 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 21:05:12,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:05:12,822 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 21:05:13,219 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:05:13,244 INFO L193 MainTranslator]: Completed translation [2018-11-07 21:05:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13 WrapperNode [2018-11-07 21:05:13,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 21:05:13,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 21:05:13,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 21:05:13,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 21:05:13,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 21:05:13,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 21:05:13,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 21:05:13,525 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 21:05:13,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (1/1) ... [2018-11-07 21:05:13,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 21:05:13,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 21:05:13,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 21:05:13,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 21:05:13,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (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 [2018-11-07 21:05:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 21:05:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 21:05:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 21:05:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 21:05:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 21:05:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 21:05:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 21:05:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 21:05:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 21:05:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 21:05:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 21:05:22,018 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 21:05:22,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:05:22 BoogieIcfgContainer [2018-11-07 21:05:22,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 21:05:22,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 21:05:22,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 21:05:22,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 21:05:22,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:05:11" (1/3) ... [2018-11-07 21:05:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7d0ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:05:22, skipping insertion in model container [2018-11-07 21:05:22,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:05:13" (2/3) ... [2018-11-07 21:05:22,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7d0ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:05:22, skipping insertion in model container [2018-11-07 21:05:22,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:05:22" (3/3) ... [2018-11-07 21:05:22,027 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label42_true-unreach-call.c [2018-11-07 21:05:22,037 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 21:05:22,047 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 21:05:22,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 21:05:22,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 21:05:22,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 21:05:22,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 21:05:22,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 21:05:22,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 21:05:22,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 21:05:22,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 21:05:22,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 21:05:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-07 21:05:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 21:05:22,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:05:22,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:05:22,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:05:22,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:05:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1611453546, now seen corresponding path program 1 times [2018-11-07 21:05:22,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:05:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:05:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:22,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:05:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:05:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:05:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:05:22,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:05:22,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:05:22,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:05:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:05:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:05:22,681 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-07 21:05:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:05:31,394 INFO L93 Difference]: Finished difference Result 2162 states and 4007 transitions. [2018-11-07 21:05:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:05:31,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-07 21:05:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:05:31,427 INFO L225 Difference]: With dead ends: 2162 [2018-11-07 21:05:31,428 INFO L226 Difference]: Without dead ends: 1552 [2018-11-07 21:05:31,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:05:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-11-07 21:05:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1525. [2018-11-07 21:05:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2018-11-07 21:05:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2696 transitions. [2018-11-07 21:05:31,598 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2696 transitions. Word has length 47 [2018-11-07 21:05:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:05:31,599 INFO L480 AbstractCegarLoop]: Abstraction has 1525 states and 2696 transitions. [2018-11-07 21:05:31,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:05:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2696 transitions. [2018-11-07 21:05:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 21:05:31,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:05:31,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:05:31,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:05:31,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:05:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1100502633, now seen corresponding path program 1 times [2018-11-07 21:05:31,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:05:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:05:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:31,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:05:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:05:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:05:32,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:05:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 21:05:32,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:05:32,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:05:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:05:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:05:32,163 INFO L87 Difference]: Start difference. First operand 1525 states and 2696 transitions. Second operand 6 states. [2018-11-07 21:05:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:05:44,641 INFO L93 Difference]: Finished difference Result 5786 states and 10670 transitions. [2018-11-07 21:05:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 21:05:44,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-07 21:05:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:05:44,675 INFO L225 Difference]: With dead ends: 5786 [2018-11-07 21:05:44,675 INFO L226 Difference]: Without dead ends: 4267 [2018-11-07 21:05:44,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 21:05:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2018-11-07 21:05:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4241. [2018-11-07 21:05:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2018-11-07 21:05:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 6348 transitions. [2018-11-07 21:05:44,854 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 6348 transitions. Word has length 126 [2018-11-07 21:05:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:05:44,856 INFO L480 AbstractCegarLoop]: Abstraction has 4241 states and 6348 transitions. [2018-11-07 21:05:44,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:05:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 6348 transitions. [2018-11-07 21:05:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 21:05:44,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:05:44,872 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:05:44,872 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:05:44,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:05:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash 427806551, now seen corresponding path program 1 times [2018-11-07 21:05:44,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:05:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:44,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:05:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:44,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:05:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:05:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:05:45,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:05:45,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 21:05:45,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:05:45,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:05:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:05:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:05:45,110 INFO L87 Difference]: Start difference. First operand 4241 states and 6348 transitions. Second operand 6 states. [2018-11-07 21:05:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:05:49,735 INFO L93 Difference]: Finished difference Result 12261 states and 20033 transitions. [2018-11-07 21:05:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 21:05:49,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 21:05:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:05:49,798 INFO L225 Difference]: With dead ends: 12261 [2018-11-07 21:05:49,798 INFO L226 Difference]: Without dead ends: 8026 [2018-11-07 21:05:49,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 21:05:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8026 states. [2018-11-07 21:05:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8026 to 7941. [2018-11-07 21:05:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7941 states. [2018-11-07 21:05:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7941 states to 7941 states and 11956 transitions. [2018-11-07 21:05:50,076 INFO L78 Accepts]: Start accepts. Automaton has 7941 states and 11956 transitions. Word has length 127 [2018-11-07 21:05:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:05:50,077 INFO L480 AbstractCegarLoop]: Abstraction has 7941 states and 11956 transitions. [2018-11-07 21:05:50,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:05:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7941 states and 11956 transitions. [2018-11-07 21:05:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 21:05:50,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:05:50,082 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:05:50,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:05:50,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:05:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 126489534, now seen corresponding path program 1 times [2018-11-07 21:05:50,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:05:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:05:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:05:50,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:05:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:05:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 81 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 21:05:50,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:05:50,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:05:50,349 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-07 21:05:50,351 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1239], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:05:50,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:05:50,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:05:50,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:05:51,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:05:51,558 INFO L272 AbstractInterpreter]: Visited 88 different actions 250 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 21:05:51,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:05:51,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:05:51,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:05:51,596 INFO L194 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:05:51,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:05:51,613 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:05:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:05:51,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:05:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:05:52,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:05:52,269 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 21:05:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:05:53,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:05:53,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 21:05:53,038 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:05:53,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 21:05:53,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 21:05:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 21:05:53,039 INFO L87 Difference]: Start difference. First operand 7941 states and 11956 transitions. Second operand 9 states. [2018-11-07 21:06:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:00,498 INFO L93 Difference]: Finished difference Result 19976 states and 30387 transitions. [2018-11-07 21:06:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 21:06:00,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2018-11-07 21:06:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:00,576 INFO L225 Difference]: With dead ends: 19976 [2018-11-07 21:06:00,576 INFO L226 Difference]: Without dead ends: 12006 [2018-11-07 21:06:00,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 400 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-11-07 21:06:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2018-11-07 21:06:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 11981. [2018-11-07 21:06:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11981 states. [2018-11-07 21:06:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11981 states to 11981 states and 15409 transitions. [2018-11-07 21:06:00,969 INFO L78 Accepts]: Start accepts. Automaton has 11981 states and 15409 transitions. Word has length 201 [2018-11-07 21:06:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:00,970 INFO L480 AbstractCegarLoop]: Abstraction has 11981 states and 15409 transitions. [2018-11-07 21:06:00,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 21:06:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 11981 states and 15409 transitions. [2018-11-07 21:06:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 21:06:00,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:00,978 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:00,979 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:00,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 118712312, now seen corresponding path program 1 times [2018-11-07 21:06:00,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:00,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:00,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:01,362 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 21:06:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 104 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 21:06:01,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:01,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:06:01,516 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-07 21:06:01,516 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1239], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:06:01,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:06:01,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:06:01,634 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:06:02,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:06:02,894 INFO L272 AbstractInterpreter]: Visited 97 different actions 378 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-07 21:06:02,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:02,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:06:02,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:02,932 INFO L194 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:06:02,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:02,944 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:06:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:06:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 21:06:03,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:06:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 21:06:03,455 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 21:06:03,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-07 21:06:03,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:06:03,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 21:06:03,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 21:06:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 21:06:03,457 INFO L87 Difference]: Start difference. First operand 11981 states and 15409 transitions. Second operand 3 states. [2018-11-07 21:06:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:06,233 INFO L93 Difference]: Finished difference Result 23956 states and 30812 transitions. [2018-11-07 21:06:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 21:06:06,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-07 21:06:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:06,280 INFO L225 Difference]: With dead ends: 23956 [2018-11-07 21:06:06,281 INFO L226 Difference]: Without dead ends: 11981 [2018-11-07 21:06:06,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 428 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 21:06:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2018-11-07 21:06:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11981. [2018-11-07 21:06:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11981 states. [2018-11-07 21:06:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11981 states to 11981 states and 14806 transitions. [2018-11-07 21:06:06,621 INFO L78 Accepts]: Start accepts. Automaton has 11981 states and 14806 transitions. Word has length 214 [2018-11-07 21:06:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:06,621 INFO L480 AbstractCegarLoop]: Abstraction has 11981 states and 14806 transitions. [2018-11-07 21:06:06,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 21:06:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11981 states and 14806 transitions. [2018-11-07 21:06:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-07 21:06:06,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:06,630 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:06,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:06,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash 115888515, now seen corresponding path program 1 times [2018-11-07 21:06:06,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:06,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 21:06:07,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:07,177 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:06:07,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-11-07 21:06:07,178 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1239], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:06:07,182 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:06:07,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:06:07,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:06:09,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:06:09,123 INFO L272 AbstractInterpreter]: Visited 98 different actions 675 times. Merged at 8 different actions 58 times. Widened at 1 different actions 2 times. Found 13 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:06:09,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:09,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:06:09,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:09,160 INFO L194 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:06:09,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:09,174 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:06:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:09,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:06:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 21:06:09,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:06:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 21:06:10,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:06:10,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-07 21:06:10,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:06:10,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 21:06:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 21:06:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 21:06:10,378 INFO L87 Difference]: Start difference. First operand 11981 states and 14806 transitions. Second operand 7 states. [2018-11-07 21:06:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:18,518 INFO L93 Difference]: Finished difference Result 35149 states and 44133 transitions. [2018-11-07 21:06:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 21:06:18,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 291 [2018-11-07 21:06:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:18,596 INFO L225 Difference]: With dead ends: 35149 [2018-11-07 21:06:18,596 INFO L226 Difference]: Without dead ends: 23140 [2018-11-07 21:06:18,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 584 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-07 21:06:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23140 states. [2018-11-07 21:06:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23140 to 21831. [2018-11-07 21:06:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21831 states. [2018-11-07 21:06:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21831 states to 21831 states and 26150 transitions. [2018-11-07 21:06:19,216 INFO L78 Accepts]: Start accepts. Automaton has 21831 states and 26150 transitions. Word has length 291 [2018-11-07 21:06:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:19,217 INFO L480 AbstractCegarLoop]: Abstraction has 21831 states and 26150 transitions. [2018-11-07 21:06:19,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 21:06:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21831 states and 26150 transitions. [2018-11-07 21:06:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-07 21:06:19,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:19,234 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:19,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:19,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1831026004, now seen corresponding path program 1 times [2018-11-07 21:06:19,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:19,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:19,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 130 proven. 146 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-07 21:06:20,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:20,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:06:20,189 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-07 21:06:20,191 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1443], [1448], [1450], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:06:20,197 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:06:20,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:06:20,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:06:21,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:06:21,935 INFO L272 AbstractInterpreter]: Visited 135 different actions 796 times. Merged at 8 different actions 47 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:06:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:21,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:06:21,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:21,965 INFO L194 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 [2018-11-07 21:06:21,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:21,977 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:06:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:22,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:06:22,841 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-07 21:06:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 238 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-07 21:06:23,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:06:24,097 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-07 21:06:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 130 proven. 227 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 21:06:24,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:06:24,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2018-11-07 21:06:24,766 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:06:24,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 21:06:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 21:06:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-07 21:06:24,769 INFO L87 Difference]: Start difference. First operand 21831 states and 26150 transitions. Second operand 10 states. [2018-11-07 21:06:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:37,661 INFO L93 Difference]: Finished difference Result 71556 states and 89640 transitions. [2018-11-07 21:06:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 21:06:37,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 337 [2018-11-07 21:06:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:37,818 INFO L225 Difference]: With dead ends: 71556 [2018-11-07 21:06:37,819 INFO L226 Difference]: Without dead ends: 45886 [2018-11-07 21:06:37,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 679 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2018-11-07 21:06:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45886 states. [2018-11-07 21:06:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45886 to 39757. [2018-11-07 21:06:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39757 states. [2018-11-07 21:06:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39757 states to 39757 states and 49159 transitions. [2018-11-07 21:06:38,736 INFO L78 Accepts]: Start accepts. Automaton has 39757 states and 49159 transitions. Word has length 337 [2018-11-07 21:06:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:38,737 INFO L480 AbstractCegarLoop]: Abstraction has 39757 states and 49159 transitions. [2018-11-07 21:06:38,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 21:06:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 39757 states and 49159 transitions. [2018-11-07 21:06:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-07 21:06:38,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:38,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:38,758 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:38,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash -227933580, now seen corresponding path program 1 times [2018-11-07 21:06:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:38,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:38,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:38,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:38,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-07 21:06:39,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:06:39,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:06:39,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:06:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:06:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:06:39,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:06:39,204 INFO L87 Difference]: Start difference. First operand 39757 states and 49159 transitions. Second operand 4 states. [2018-11-07 21:06:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:46,114 INFO L93 Difference]: Finished difference Result 108856 states and 139286 transitions. [2018-11-07 21:06:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:06:46,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-11-07 21:06:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:46,286 INFO L225 Difference]: With dead ends: 108856 [2018-11-07 21:06:46,287 INFO L226 Difference]: Without dead ends: 53298 [2018-11-07 21:06:46,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:06:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53298 states. [2018-11-07 21:06:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53298 to 49236. [2018-11-07 21:06:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49236 states. [2018-11-07 21:06:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49236 states to 49236 states and 59895 transitions. [2018-11-07 21:06:47,471 INFO L78 Accepts]: Start accepts. Automaton has 49236 states and 59895 transitions. Word has length 374 [2018-11-07 21:06:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:47,472 INFO L480 AbstractCegarLoop]: Abstraction has 49236 states and 59895 transitions. [2018-11-07 21:06:47,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:06:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 49236 states and 59895 transitions. [2018-11-07 21:06:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-11-07 21:06:47,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:47,512 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:47,512 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:47,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 479746725, now seen corresponding path program 1 times [2018-11-07 21:06:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:47,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:47,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:06:48,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:48,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:06:48,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 479 with the following transitions: [2018-11-07 21:06:48,024 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1376], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1654], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:06:48,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:06:48,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:06:48,088 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:06:51,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:06:51,222 INFO L272 AbstractInterpreter]: Visited 171 different actions 1196 times. Merged at 9 different actions 66 times. Widened at 1 different actions 2 times. Found 18 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:06:51,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:51,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:06:51,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:51,241 INFO L194 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:06:51,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:51,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:06:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:51,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:06:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:06:51,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:06:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:06:52,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:06:52,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2018-11-07 21:06:52,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:06:52,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:06:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:06:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 21:06:52,055 INFO L87 Difference]: Start difference. First operand 49236 states and 59895 transitions. Second operand 6 states. [2018-11-07 21:06:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:06:58,256 INFO L93 Difference]: Finished difference Result 106258 states and 129324 transitions. [2018-11-07 21:06:58,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 21:06:58,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 478 [2018-11-07 21:06:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:06:58,393 INFO L225 Difference]: With dead ends: 106258 [2018-11-07 21:06:58,393 INFO L226 Difference]: Without dead ends: 51034 [2018-11-07 21:06:58,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 958 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-07 21:06:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51034 states. [2018-11-07 21:06:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51034 to 47665. [2018-11-07 21:06:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47665 states. [2018-11-07 21:06:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47665 states to 47665 states and 57907 transitions. [2018-11-07 21:06:59,357 INFO L78 Accepts]: Start accepts. Automaton has 47665 states and 57907 transitions. Word has length 478 [2018-11-07 21:06:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:06:59,358 INFO L480 AbstractCegarLoop]: Abstraction has 47665 states and 57907 transitions. [2018-11-07 21:06:59,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:06:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 47665 states and 57907 transitions. [2018-11-07 21:06:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-11-07 21:06:59,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:06:59,389 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:06:59,389 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:06:59,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:06:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash 610369496, now seen corresponding path program 1 times [2018-11-07 21:06:59,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:06:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:06:59,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:06:59,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:06:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:06:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:06:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:06:59,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:06:59,971 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 498 with the following transitions: [2018-11-07 21:06:59,972 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1376], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1758], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:06:59,979 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:06:59,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:07:00,033 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:07:03,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:07:03,291 INFO L272 AbstractInterpreter]: Visited 190 different actions 1522 times. Merged at 9 different actions 80 times. Widened at 1 different actions 3 times. Found 21 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:07:03,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:07:03,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:07:03,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:07:03,308 INFO L194 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 [2018-11-07 21:07:03,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:07:03,316 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:07:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:07:03,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:07:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:07:03,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:07:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 389 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:07:03,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:07:03,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 21:07:03,881 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:07:03,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:07:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:07:03,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 21:07:03,883 INFO L87 Difference]: Start difference. First operand 47665 states and 57907 transitions. Second operand 6 states. [2018-11-07 21:07:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:07:10,322 INFO L93 Difference]: Finished difference Result 108907 states and 134750 transitions. [2018-11-07 21:07:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 21:07:10,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 497 [2018-11-07 21:07:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:07:10,472 INFO L225 Difference]: With dead ends: 108907 [2018-11-07 21:07:10,472 INFO L226 Difference]: Without dead ends: 56178 [2018-11-07 21:07:10,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 994 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-07 21:07:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56178 states. [2018-11-07 21:07:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56178 to 53998. [2018-11-07 21:07:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53998 states. [2018-11-07 21:07:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53998 states to 53998 states and 65256 transitions. [2018-11-07 21:07:12,096 INFO L78 Accepts]: Start accepts. Automaton has 53998 states and 65256 transitions. Word has length 497 [2018-11-07 21:07:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:07:12,097 INFO L480 AbstractCegarLoop]: Abstraction has 53998 states and 65256 transitions. [2018-11-07 21:07:12,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:07:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53998 states and 65256 transitions. [2018-11-07 21:07:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-11-07 21:07:12,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:07:12,120 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:07:12,121 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:07:12,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:07:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -569907959, now seen corresponding path program 1 times [2018-11-07 21:07:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:07:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:07:12,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:07:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:07:12,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:07:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:07:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 128 proven. 2 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-11-07 21:07:12,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:07:12,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:07:12,558 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 501 with the following transitions: [2018-11-07 21:07:12,558 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1420], [1425], [1427], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2031], [2034], [2038], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:07:12,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:07:12,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:07:12,623 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:07:13,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 21:07:13,558 INFO L272 AbstractInterpreter]: Visited 252 different actions 742 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 21:07:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:07:13,563 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 21:07:14,503 INFO L227 lantSequenceWeakener]: Weakened 494 states. On average, predicates are now at 75.27% of their original sizes. [2018-11-07 21:07:14,504 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 21:07:15,009 INFO L415 sIntCurrentIteration]: We unified 499 AI predicates to 499 [2018-11-07 21:07:15,009 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 21:07:15,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 21:07:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [3] total 13 [2018-11-07 21:07:15,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:07:15,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 21:07:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 21:07:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 21:07:15,012 INFO L87 Difference]: Start difference. First operand 53998 states and 65256 transitions. Second operand 12 states. [2018-11-07 21:08:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:08:21,087 INFO L93 Difference]: Finished difference Result 113265 states and 137173 transitions. [2018-11-07 21:08:21,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 21:08:21,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 500 [2018-11-07 21:08:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:08:21,236 INFO L225 Difference]: With dead ends: 113265 [2018-11-07 21:08:21,237 INFO L226 Difference]: Without dead ends: 59707 [2018-11-07 21:08:21,307 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 513 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-11-07 21:08:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59707 states. [2018-11-07 21:08:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59707 to 59312. [2018-11-07 21:08:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59312 states. [2018-11-07 21:08:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59312 states to 59312 states and 71310 transitions. [2018-11-07 21:08:22,372 INFO L78 Accepts]: Start accepts. Automaton has 59312 states and 71310 transitions. Word has length 500 [2018-11-07 21:08:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:08:22,373 INFO L480 AbstractCegarLoop]: Abstraction has 59312 states and 71310 transitions. [2018-11-07 21:08:22,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 21:08:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59312 states and 71310 transitions. [2018-11-07 21:08:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-11-07 21:08:22,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:08:22,403 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:08:22,403 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:08:22,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:08:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1868142434, now seen corresponding path program 1 times [2018-11-07 21:08:22,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:08:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:22,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:08:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:22,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:08:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:08:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 176 proven. 2 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-11-07 21:08:23,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:08:23,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:08:23,720 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 576 with the following transitions: [2018-11-07 21:08:23,720 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1420], [1425], [1427], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2031], [2034], [2038], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:08:23,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:08:23,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:08:23,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:08:25,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:08:25,051 INFO L272 AbstractInterpreter]: Visited 254 different actions 1254 times. Merged at 7 different actions 31 times. Never widened. Found 6 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:08:25,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:08:25,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:08:25,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:08:25,058 INFO L194 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:08:25,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:08:25,067 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:08:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:08:25,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:08:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-07 21:08:25,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:08:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 176 proven. 2 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2018-11-07 21:08:26,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 21:08:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-11-07 21:08:26,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:08:26,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 21:08:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 21:08:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:08:26,083 INFO L87 Difference]: Start difference. First operand 59312 states and 71310 transitions. Second operand 3 states. [2018-11-07 21:08:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:08:28,990 INFO L93 Difference]: Finished difference Result 136861 states and 166758 transitions. [2018-11-07 21:08:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 21:08:28,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 575 [2018-11-07 21:08:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:08:29,126 INFO L225 Difference]: With dead ends: 136861 [2018-11-07 21:08:29,126 INFO L226 Difference]: Without dead ends: 66234 [2018-11-07 21:08:29,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1152 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:08:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66234 states. [2018-11-07 21:08:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66234 to 61793. [2018-11-07 21:08:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61793 states. [2018-11-07 21:08:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61793 states to 61793 states and 73815 transitions. [2018-11-07 21:08:30,067 INFO L78 Accepts]: Start accepts. Automaton has 61793 states and 73815 transitions. Word has length 575 [2018-11-07 21:08:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:08:30,068 INFO L480 AbstractCegarLoop]: Abstraction has 61793 states and 73815 transitions. [2018-11-07 21:08:30,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 21:08:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 61793 states and 73815 transitions. [2018-11-07 21:08:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-11-07 21:08:30,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:08:30,092 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:08:30,092 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:08:30,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:08:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash 845203067, now seen corresponding path program 1 times [2018-11-07 21:08:30,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:08:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:30,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:08:30,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:30,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:08:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:08:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-11-07 21:08:30,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:08:30,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 21:08:30,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:08:30,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 21:08:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 21:08:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:08:30,862 INFO L87 Difference]: Start difference. First operand 61793 states and 73815 transitions. Second operand 3 states. [2018-11-07 21:08:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:08:33,890 INFO L93 Difference]: Finished difference Result 129882 states and 156229 transitions. [2018-11-07 21:08:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 21:08:33,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2018-11-07 21:08:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:08:34,025 INFO L225 Difference]: With dead ends: 129882 [2018-11-07 21:08:34,025 INFO L226 Difference]: Without dead ends: 63804 [2018-11-07 21:08:34,113 INFO L604 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 [2018-11-07 21:08:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63804 states. [2018-11-07 21:08:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63804 to 59442. [2018-11-07 21:08:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59442 states. [2018-11-07 21:08:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59442 states to 59442 states and 69174 transitions. [2018-11-07 21:08:34,887 INFO L78 Accepts]: Start accepts. Automaton has 59442 states and 69174 transitions. Word has length 663 [2018-11-07 21:08:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:08:34,888 INFO L480 AbstractCegarLoop]: Abstraction has 59442 states and 69174 transitions. [2018-11-07 21:08:34,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 21:08:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59442 states and 69174 transitions. [2018-11-07 21:08:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2018-11-07 21:08:34,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:08:34,958 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:08:34,958 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:08:34,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:08:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1571735747, now seen corresponding path program 1 times [2018-11-07 21:08:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:08:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:34,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:08:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:08:34,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:08:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 21:08:35,308 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-07 21:08:35,312 INFO L168 Benchmark]: Toolchain (without parser) took 203725.24 ms. Allocated memory was 1.5 GB in the beginning and 5.6 GB in the end (delta: 4.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -565.1 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,314 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:08:35,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1655.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 279.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -971.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,319 INFO L168 Benchmark]: Boogie Preprocessor took 243.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,319 INFO L168 Benchmark]: RCFGBuilder took 8249.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 465.8 MB). Peak memory consumption was 465.8 MB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,321 INFO L168 Benchmark]: TraceAbstraction took 193291.94 ms. Allocated memory was 2.3 GB in the beginning and 5.6 GB in the end (delta: 3.3 GB). Free memory was 1.8 GB in the beginning and 2.0 GB in the end (delta: -210.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 21:08:35,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1655.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 279.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -971.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 243.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8249.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 465.8 MB). Peak memory consumption was 465.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193291.94 ms. Allocated memory was 2.3 GB in the beginning and 5.6 GB in the end (delta: 3.3 GB). Free memory was 1.8 GB in the beginning and 2.0 GB in the end (delta: -210.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown