java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:54:48,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:54:48,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:54:48,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:54:48,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:54:48,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:54:48,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:54:48,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:54:48,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:54:48,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:54:48,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:54:48,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:54:48,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:54:48,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:54:48,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:54:48,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:54:48,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:54:48,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:54:48,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:54:48,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:54:48,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:54:48,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:54:48,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:54:48,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:54:48,697 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:54:48,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:54:48,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:54:48,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:54:48,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:54:48,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:54:48,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:54:48,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:54:48,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:54:48,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:54:48,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:54:48,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:54:48,713 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:54:48,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:54:48,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:54:48,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:54:48,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:54:48,730 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:54:48,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:54:48,730 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:54:48,730 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:54:48,731 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:54:48,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:54:48,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:54:48,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:54:48,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:54:48,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:54:48,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:54:48,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:54:48,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:54:48,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:54:48,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:54:48,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:54:48,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:54:48,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:54:48,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:54:48,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:54:48,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:54:48,736 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:54:48,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:54:48,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:54:48,736 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:54:48,737 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:54:48,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:54:48,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:54:48,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:54:48,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:54:48,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:54:48,804 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:54:48,804 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label03_true-unreach-call.c [2018-10-25 01:54:48,865 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f1f141896/f267484d16fd42c88e08fc9dd7daa0d2/FLAG08dddfcc4 [2018-10-25 01:54:49,561 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:54:49,562 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label03_true-unreach-call.c [2018-10-25 01:54:49,596 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f1f141896/f267484d16fd42c88e08fc9dd7daa0d2/FLAG08dddfcc4 [2018-10-25 01:54:49,618 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f1f141896/f267484d16fd42c88e08fc9dd7daa0d2 [2018-10-25 01:54:49,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:54:49,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:54:49,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:49,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:54:49,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:54:49,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:49" (1/1) ... [2018-10-25 01:54:49,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769a0e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:49, skipping insertion in model container [2018-10-25 01:54:49,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:49" (1/1) ... [2018-10-25 01:54:49,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:54:49,786 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:54:50,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:50,800 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:54:51,243 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:51,268 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:54:51,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51 WrapperNode [2018-10-25 01:54:51,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:51,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:51,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:54:51,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:54:51,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:51,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:54:51,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:54:51,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:54:51,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:51,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:54:52,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:54:52,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:54:52,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:54:52,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 01:54:52,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:54:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:54:52,115 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:54:52,115 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:54:52,116 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:54:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:54:52,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:54:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:54:52,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:54:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:55:04,804 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:55:04,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:04 BoogieIcfgContainer [2018-10-25 01:55:04,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:55:04,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:55:04,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:55:04,811 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:55:04,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:54:49" (1/3) ... [2018-10-25 01:55:04,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0846e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:04, skipping insertion in model container [2018-10-25 01:55:04,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (2/3) ... [2018-10-25 01:55:04,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0846e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:04, skipping insertion in model container [2018-10-25 01:55:04,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:04" (3/3) ... [2018-10-25 01:55:04,815 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label03_true-unreach-call.c [2018-10-25 01:55:04,826 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:55:04,840 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:55:04,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:55:04,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:55:04,914 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:55:04,914 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:55:04,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:55:04,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:55:04,915 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:55:04,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:55:04,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:55:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-25 01:55:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 01:55:04,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:04,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:55:04,973 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:04,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1535738860, now seen corresponding path program 1 times [2018-10-25 01:55:04,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:05,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:05,569 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:05,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:05,597 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-25 01:55:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:16,068 INFO L93 Difference]: Finished difference Result 2164 states and 4009 transitions. [2018-10-25 01:55:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:16,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-10-25 01:55:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:16,119 INFO L225 Difference]: With dead ends: 2164 [2018-10-25 01:55:16,119 INFO L226 Difference]: Without dead ends: 1554 [2018-10-25 01:55:16,129 INFO L605 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-10-25 01:55:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-10-25 01:55:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1052. [2018-10-25 01:55:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-10-25 01:55:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1882 transitions. [2018-10-25 01:55:16,260 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1882 transitions. Word has length 56 [2018-10-25 01:55:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:16,261 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1882 transitions. [2018-10-25 01:55:16,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1882 transitions. [2018-10-25 01:55:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 01:55:16,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:16,269 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, 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] [2018-10-25 01:55:16,269 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1304567782, now seen corresponding path program 1 times [2018-10-25 01:55:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:16,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:16,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:16,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:55:16,563 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:16,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:55:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:55:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:55:16,566 INFO L87 Difference]: Start difference. First operand 1052 states and 1882 transitions. Second operand 5 states. [2018-10-25 01:55:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:25,375 INFO L93 Difference]: Finished difference Result 3031 states and 5537 transitions. [2018-10-25 01:55:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:55:25,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-25 01:55:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:25,391 INFO L225 Difference]: With dead ends: 3031 [2018-10-25 01:55:25,391 INFO L226 Difference]: Without dead ends: 1985 [2018-10-25 01:55:25,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:55:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2018-10-25 01:55:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1959. [2018-10-25 01:55:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2018-10-25 01:55:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3239 transitions. [2018-10-25 01:55:25,482 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3239 transitions. Word has length 128 [2018-10-25 01:55:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:25,483 INFO L481 AbstractCegarLoop]: Abstraction has 1959 states and 3239 transitions. [2018-10-25 01:55:25,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:55:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3239 transitions. [2018-10-25 01:55:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 01:55:25,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:25,488 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, 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] [2018-10-25 01:55:25,489 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:25,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1286141214, now seen corresponding path program 1 times [2018-10-25 01:55:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:25,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:25,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:55:25,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-10-25 01:55:26,000 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], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1058], [1060], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:55:26,069 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:55:26,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:55:28,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:55:28,027 INFO L272 AbstractInterpreter]: Visited 83 different actions 235 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:55:28,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:28,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:55:28,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:28,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 01:55:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:28,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:55:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:28,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:55:32,012 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-25 01:55:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:34,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:55:34,690 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-25 01:55:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:34,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 01:55:34,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 11 [2018-10-25 01:55:34,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:34,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:55:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:55:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=78, Unknown=2, NotChecked=0, Total=110 [2018-10-25 01:55:34,935 INFO L87 Difference]: Start difference. First operand 1959 states and 3239 transitions. Second operand 3 states. [2018-10-25 01:55:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:41,194 INFO L93 Difference]: Finished difference Result 5689 states and 9646 transitions. [2018-10-25 01:55:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:55:41,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-25 01:55:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:41,217 INFO L225 Difference]: With dead ends: 5689 [2018-10-25 01:55:41,217 INFO L226 Difference]: Without dead ends: 3736 [2018-10-25 01:55:41,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 258 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=30, Invalid=78, Unknown=2, NotChecked=0, Total=110 [2018-10-25 01:55:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2018-10-25 01:55:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3733. [2018-10-25 01:55:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2018-10-25 01:55:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5526 transitions. [2018-10-25 01:55:41,333 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5526 transitions. Word has length 131 [2018-10-25 01:55:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:41,334 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 5526 transitions. [2018-10-25 01:55:41,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:55:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5526 transitions. [2018-10-25 01:55:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-25 01:55:41,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:41,340 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, 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] [2018-10-25 01:55:41,340 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:41,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1968123582, now seen corresponding path program 1 times [2018-10-25 01:55:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:41,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:41,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:41,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:41,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 01:55:41,679 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:41,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 01:55:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 01:55:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:55:41,680 INFO L87 Difference]: Start difference. First operand 3733 states and 5526 transitions. Second operand 7 states. [2018-10-25 01:55:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:57,771 INFO L93 Difference]: Finished difference Result 12809 states and 21216 transitions. [2018-10-25 01:55:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:55:57,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2018-10-25 01:55:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:57,836 INFO L225 Difference]: With dead ends: 12809 [2018-10-25 01:55:57,836 INFO L226 Difference]: Without dead ends: 9082 [2018-10-25 01:55:57,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:55:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2018-10-25 01:55:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 8957. [2018-10-25 01:55:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8957 states. [2018-10-25 01:55:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8957 states to 8957 states and 13358 transitions. [2018-10-25 01:55:58,176 INFO L78 Accepts]: Start accepts. Automaton has 8957 states and 13358 transitions. Word has length 158 [2018-10-25 01:55:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:58,176 INFO L481 AbstractCegarLoop]: Abstraction has 8957 states and 13358 transitions. [2018-10-25 01:55:58,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 01:55:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 8957 states and 13358 transitions. [2018-10-25 01:55:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:55:58,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:58,190 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, 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] [2018-10-25 01:55:58,190 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:58,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1891195745, now seen corresponding path program 1 times [2018-10-25 01:55:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:58,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:55:58,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:58,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:55:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:55:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:55:58,398 INFO L87 Difference]: Start difference. First operand 8957 states and 13358 transitions. Second operand 5 states. [2018-10-25 01:56:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:56:12,143 INFO L93 Difference]: Finished difference Result 29419 states and 47576 transitions. [2018-10-25 01:56:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:56:12,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-10-25 01:56:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:56:12,268 INFO L225 Difference]: With dead ends: 29419 [2018-10-25 01:56:12,268 INFO L226 Difference]: Without dead ends: 20468 [2018-10-25 01:56:12,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:56:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-10-25 01:56:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20171. [2018-10-25 01:56:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20171 states. [2018-10-25 01:56:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20171 states to 20171 states and 27872 transitions. [2018-10-25 01:56:12,956 INFO L78 Accepts]: Start accepts. Automaton has 20171 states and 27872 transitions. Word has length 170 [2018-10-25 01:56:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:56:12,956 INFO L481 AbstractCegarLoop]: Abstraction has 20171 states and 27872 transitions. [2018-10-25 01:56:12,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:56:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 20171 states and 27872 transitions. [2018-10-25 01:56:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-25 01:56:12,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:56:12,979 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 01:56:12,979 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:56:12,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:56:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1388015723, now seen corresponding path program 1 times [2018-10-25 01:56:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:56:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:56:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:56:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:56:12,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:56:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:56:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 61 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 01:56:13,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:56:13,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:56:13,943 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-10-25 01:56:13,944 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], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1058], [1060], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1211], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:56:13,954 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:56:13,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:56:14,198 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:56:14,198 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:56:14,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:56:14,227 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:56:14,666 INFO L232 lantSequenceWeakener]: Weakened 229 states. On average, predicates are now at 75.66% of their original sizes. [2018-10-25 01:56:14,667 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:56:14,850 INFO L413 sIntCurrentIteration]: We have 237 unified AI predicates [2018-10-25 01:56:14,850 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:56:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:56:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-10-25 01:56:14,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:56:14,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:56:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:56:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:56:14,853 INFO L87 Difference]: Start difference. First operand 20171 states and 27872 transitions. Second operand 6 states. [2018-10-25 01:57:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:57:04,087 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) 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-10-25 01:57:04,091 INFO L168 Benchmark]: Toolchain (without parser) took 134460.44 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -610.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:57:04,093 INFO L168 Benchmark]: CDTParser took 0.22 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-10-25 01:57:04,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1634.43 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-10-25 01:57:04,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 462.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.6 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:57:04,095 INFO L168 Benchmark]: Boogie Preprocessor took 308.80 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:57:04,096 INFO L168 Benchmark]: RCFGBuilder took 12764.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.9 MB). Peak memory consumption was 478.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:57:04,098 INFO L168 Benchmark]: TraceAbstraction took 119283.21 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -325.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:57:04,107 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.22 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 1634.43 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 462.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.6 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 308.80 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12764.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.9 MB). Peak memory consumption was 478.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119283.21 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -325.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...