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/Problem10_label22_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:24:04,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:24:04,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:24:04,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:24:04,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:24:04,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:24:04,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:24:04,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:24:04,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:24:04,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:24:04,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:24:04,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:24:04,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:24:04,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:24:04,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:24:04,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:24:04,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:24:04,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:24:04,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:24:04,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:24:04,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:24:04,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:24:04,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:24:04,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:24:04,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:24:04,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:24:04,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:24:04,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:24:04,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:24:04,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:24:04,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:24:04,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:24:04,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:24:04,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:24:04,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:24:04,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:24:04,734 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:24:04,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:24:04,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:24:04,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:24:04,750 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:24:04,750 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:24:04,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:24:04,751 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:24:04,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:24:04,751 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:24:04,751 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:24:04,751 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:24:04,752 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:24:04,752 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:24:04,752 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:24:04,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:24:04,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:24:04,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:24:04,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:24:04,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:24:04,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:24:04,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:24:04,754 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:24:04,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:24:04,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:24:04,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:24:04,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:24:04,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:24:04,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:24:04,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:24:04,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:24:04,756 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:24:04,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:24:04,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:24:04,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:24:04,759 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:24:04,760 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:24:04,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:24:04,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:24:04,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:24:04,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:24:04,850 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:24:04,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-10-25 01:24:04,914 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4024ff4ac/159a2c36d3994e2cb0cb483d56b9c31e/FLAGe2b6c0d42 [2018-10-25 01:24:05,457 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:24:05,458 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-10-25 01:24:05,480 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4024ff4ac/159a2c36d3994e2cb0cb483d56b9c31e/FLAGe2b6c0d42 [2018-10-25 01:24:05,504 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4024ff4ac/159a2c36d3994e2cb0cb483d56b9c31e [2018-10-25 01:24:05,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:24:05,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:24:05,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:05,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:24:05,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:24:05,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:05" (1/1) ... [2018-10-25 01:24:05,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ad0ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:05, skipping insertion in model container [2018-10-25 01:24:05,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:05" (1/1) ... [2018-10-25 01:24:05,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:24:05,613 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:24:06,023 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:06,027 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:24:06,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:06,166 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:24:06,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06 WrapperNode [2018-10-25 01:24:06,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:06,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:06,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:24:06,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:24:06,177 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:24:06" (1/1) ... [2018-10-25 01:24:06,196 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:24:06" (1/1) ... [2018-10-25 01:24:06,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:06,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:24:06,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:24:06,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:24:06,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (1/1) ... [2018-10-25 01:24:06,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:24:06,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:24:06,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:24:06,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:24:06,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (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:24:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:24:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:24:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:24:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:24:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:24:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:24:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:24:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:24:09,537 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:24:09,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:09 BoogieIcfgContainer [2018-10-25 01:24:09,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:24:09,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:24:09,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:24:09,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:24:09,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:24:05" (1/3) ... [2018-10-25 01:24:09,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15088e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:09, skipping insertion in model container [2018-10-25 01:24:09,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:06" (2/3) ... [2018-10-25 01:24:09,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15088e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:09, skipping insertion in model container [2018-10-25 01:24:09,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:09" (3/3) ... [2018-10-25 01:24:09,546 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label22_true-unreach-call.c [2018-10-25 01:24:09,554 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:24:09,562 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:24:09,579 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:24:09,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:24:09,618 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:24:09,618 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:24:09,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:24:09,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:24:09,619 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:24:09,619 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:24:09,619 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:24:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-25 01:24:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-25 01:24:09,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:09,655 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] [2018-10-25 01:24:09,657 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 625689180, now seen corresponding path program 1 times [2018-10-25 01:24:09,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:09,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:09,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:09,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:09,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:10,149 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:24:10,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:10,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:24:10,152 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:10,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:24:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:24:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:10,182 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-10-25 01:24:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:12,703 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-10-25 01:24:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:24:12,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-25 01:24:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:12,724 INFO L225 Difference]: With dead ends: 737 [2018-10-25 01:24:12,725 INFO L226 Difference]: Without dead ends: 515 [2018-10-25 01:24:12,734 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:24:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-25 01:24:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-10-25 01:24:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-25 01:24:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-10-25 01:24:12,827 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 44 [2018-10-25 01:24:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:12,829 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-10-25 01:24:12,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:24:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-10-25 01:24:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 01:24:12,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:12,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,845 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2101120931, now seen corresponding path program 1 times [2018-10-25 01:24:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:12,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:13,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:13,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:13,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:13,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:13,228 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-10-25 01:24:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:16,151 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-10-25 01:24:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:16,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-10-25 01:24:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:16,164 INFO L225 Difference]: With dead ends: 1863 [2018-10-25 01:24:16,165 INFO L226 Difference]: Without dead ends: 1354 [2018-10-25 01:24:16,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-25 01:24:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-10-25 01:24:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-25 01:24:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-10-25 01:24:16,266 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 119 [2018-10-25 01:24:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:16,267 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-10-25 01:24:16,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-10-25 01:24:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:24:16,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:16,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,272 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:16,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash 51887807, now seen corresponding path program 1 times [2018-10-25 01:24:16,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:16,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:16,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:16,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:16,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:16,550 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:16,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:16,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:16,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:16,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:16,742 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-10-25 01:24:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:20,703 INFO L93 Difference]: Finished difference Result 3512 states and 5693 transitions. [2018-10-25 01:24:20,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:20,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-25 01:24:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:20,722 INFO L225 Difference]: With dead ends: 3512 [2018-10-25 01:24:20,723 INFO L226 Difference]: Without dead ends: 2187 [2018-10-25 01:24:20,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-10-25 01:24:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165. [2018-10-25 01:24:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-10-25 01:24:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions. [2018-10-25 01:24:20,819 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 121 [2018-10-25 01:24:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:20,820 INFO L481 AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions. [2018-10-25 01:24:20,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions. [2018-10-25 01:24:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:24:20,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:20,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:20,824 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:20,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -344279760, now seen corresponding path program 1 times [2018-10-25 01:24:20,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:20,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:20,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:20,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:21,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 01:24:21,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:21,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 01:24:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 01:24:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:24:21,058 INFO L87 Difference]: Start difference. First operand 2165 states and 3178 transitions. Second operand 7 states. [2018-10-25 01:24:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:23,416 INFO L93 Difference]: Finished difference Result 5115 states and 7643 transitions. [2018-10-25 01:24:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:24:23,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-10-25 01:24:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:23,433 INFO L225 Difference]: With dead ends: 5115 [2018-10-25 01:24:23,433 INFO L226 Difference]: Without dead ends: 2160 [2018-10-25 01:24:23,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-10-25 01:24:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2160. [2018-10-25 01:24:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2018-10-25 01:24:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 3146 transitions. [2018-10-25 01:24:23,525 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 3146 transitions. Word has length 124 [2018-10-25 01:24:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:23,526 INFO L481 AbstractCegarLoop]: Abstraction has 2160 states and 3146 transitions. [2018-10-25 01:24:23,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 01:24:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 3146 transitions. [2018-10-25 01:24:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-25 01:24:23,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:23,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,531 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:23,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash -303205129, now seen corresponding path program 1 times [2018-10-25 01:24:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:23,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:23,846 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:24:24,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:24:24,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:24:24,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-10-25 01:24:24,071 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:24:24,114 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:24:24,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:24:24,564 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:24:24,565 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:24:24,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:24,616 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:24:24,998 INFO L232 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 73.55% of their original sizes. [2018-10-25 01:24:24,999 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:24:25,256 INFO L413 sIntCurrentIteration]: We have 124 unified AI predicates [2018-10-25 01:24:25,257 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:24:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:24:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-25 01:24:25,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:25,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:25,260 INFO L87 Difference]: Start difference. First operand 2160 states and 3146 transitions. Second operand 6 states. [2018-10-25 01:24:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:57,418 INFO L93 Difference]: Finished difference Result 4460 states and 6503 transitions. [2018-10-25 01:24:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:24:57,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-25 01:24:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:57,431 INFO L225 Difference]: With dead ends: 4460 [2018-10-25 01:24:57,431 INFO L226 Difference]: Without dead ends: 2306 [2018-10-25 01:24:57,440 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:24:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-10-25 01:24:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2304. [2018-10-25 01:24:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2018-10-25 01:24:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3298 transitions. [2018-10-25 01:24:57,501 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3298 transitions. Word has length 125 [2018-10-25 01:24:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:57,501 INFO L481 AbstractCegarLoop]: Abstraction has 2304 states and 3298 transitions. [2018-10-25 01:24:57,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3298 transitions. [2018-10-25 01:24:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 01:24:57,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:57,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:57,505 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:57,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash -679371352, now seen corresponding path program 1 times [2018-10-25 01:24:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:57,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:57,755 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:24:57,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:24:57,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:24:57,787 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-25 01:24:57,788 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:24:57,796 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:24:57,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:24:58,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:24:58,119 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-25 01:24:58,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:58,157 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:24:58,582 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 73.46% of their original sizes. [2018-10-25 01:24:58,582 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:24:59,032 INFO L413 sIntCurrentIteration]: We have 159 unified AI predicates [2018-10-25 01:24:59,033 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:24:59,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:24:59,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-25 01:24:59,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:59,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 01:24:59,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 01:24:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:24:59,035 INFO L87 Difference]: Start difference. First operand 2304 states and 3298 transitions. Second operand 10 states. [2018-10-25 01:26:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 01:26:10,941 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: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: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:26:10,947 INFO L168 Benchmark]: Toolchain (without parser) took 125431.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 730.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,948 INFO L168 Benchmark]: CDTParser took 0.18 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:26:10,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,951 INFO L168 Benchmark]: Boogie Preprocessor took 135.76 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,951 INFO L168 Benchmark]: RCFGBuilder took 3047.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.1 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,952 INFO L168 Benchmark]: TraceAbstraction took 121406.66 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 641.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:26:10,959 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.18 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 649.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 185.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.76 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3047.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.1 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121406.66 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 641.9 MB. 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...