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/Problem12_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:32:01,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:32:01,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:32:01,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:32:01,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:32:01,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:32:01,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:32:01,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:32:01,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:32:01,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:32:01,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:32:01,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:32:01,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:32:01,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:32:01,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:32:01,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:32:01,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:32:01,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:32:01,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:32:01,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:32:01,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:32:01,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:32:01,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:32:01,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:32:01,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:32:01,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:32:01,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:32:01,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:32:01,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:32:01,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:32:01,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:32:01,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:32:01,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:32:01,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:32:01,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:32:01,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:32:01,583 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-24 23:32:01,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:32:01,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:32:01,610 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:32:01,610 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:32:01,611 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:32:01,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:32:01,611 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:32:01,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:32:01,611 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:32:01,612 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:32:01,612 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:32:01,612 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:32:01,612 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:32:01,612 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:32:01,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:32:01,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:32:01,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:32:01,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:32:01,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:32:01,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:32:01,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:32:01,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:32:01,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:32:01,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:32:01,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:32:01,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:32:01,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:01,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:32:01,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:32:01,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:32:01,617 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:32:01,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:32:01,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:32:01,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:32:01,618 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:32:01,618 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:32:01,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:32:01,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:32:01,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:32:01,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:32:01,711 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:32:01,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-24 23:32:01,771 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2bbc7cc4f/3ced6f7360f14e87a6e4b35eb85b1ef1/FLAGa25211c08 [2018-10-24 23:32:02,530 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:32:02,531 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-24 23:32:02,567 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2bbc7cc4f/3ced6f7360f14e87a6e4b35eb85b1ef1/FLAGa25211c08 [2018-10-24 23:32:02,591 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2bbc7cc4f/3ced6f7360f14e87a6e4b35eb85b1ef1 [2018-10-24 23:32:02,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:32:02,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:32:02,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:02,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:32:02,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:32:02,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:02" (1/1) ... [2018-10-24 23:32:02,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ad132a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:02, skipping insertion in model container [2018-10-24 23:32:02,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:02" (1/1) ... [2018-10-24 23:32:02,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:32:02,804 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:32:04,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:04,027 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:32:04,688 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:04,725 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:32:04,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04 WrapperNode [2018-10-24 23:32:04,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:04,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:04,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:32:04,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:32:04,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:04,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:05,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:32:05,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:32:05,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:32:05,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (1/1) ... [2018-10-24 23:32:05,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:32:05,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:32:05,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:32:05,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:32:05,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (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-24 23:32:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:32:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:32:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:32:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:32:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:32:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:32:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:32:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:32:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:32:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:32:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:32:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:32:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:32:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:32:19,031 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:32:19,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:19 BoogieIcfgContainer [2018-10-24 23:32:19,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:32:19,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:32:19,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:32:19,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:32:19,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:32:02" (1/3) ... [2018-10-24 23:32:19,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fe6e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:19, skipping insertion in model container [2018-10-24 23:32:19,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:04" (2/3) ... [2018-10-24 23:32:19,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fe6e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:19, skipping insertion in model container [2018-10-24 23:32:19,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:19" (3/3) ... [2018-10-24 23:32:19,043 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label25_false-unreach-call.c [2018-10-24 23:32:19,054 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:32:19,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:32:19,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:32:19,142 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:32:19,142 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:32:19,142 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:32:19,142 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:32:19,142 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:32:19,143 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:32:19,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:32:19,143 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:32:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:32:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 23:32:19,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:19,191 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] [2018-10-24 23:32:19,193 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:19,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -82660212, now seen corresponding path program 1 times [2018-10-24 23:32:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:19,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:19,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:19,586 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:32:19,670 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-24 23:32:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:32:19,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:19,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:32:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:32:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:32:19,700 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-24 23:32:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:28,254 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-24 23:32:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:32:28,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-24 23:32:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:28,302 INFO L225 Difference]: With dead ends: 2446 [2018-10-24 23:32:28,302 INFO L226 Difference]: Without dead ends: 1604 [2018-10-24 23:32:28,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:32:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-24 23:32:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-24 23:32:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:32:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3021 transitions. [2018-10-24 23:32:28,509 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3021 transitions. Word has length 24 [2018-10-24 23:32:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:28,509 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 3021 transitions. [2018-10-24 23:32:28,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:32:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3021 transitions. [2018-10-24 23:32:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 23:32:28,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:28,517 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:32:28,520 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:28,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash -664739510, now seen corresponding path program 1 times [2018-10-24 23:32:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:28,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:28,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:28,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:28,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:32:28,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:28,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:32:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:32:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:32:28,909 INFO L87 Difference]: Start difference. First operand 1604 states and 3021 transitions. Second operand 5 states. [2018-10-24 23:32:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:45,060 INFO L93 Difference]: Finished difference Result 4873 states and 9189 transitions. [2018-10-24 23:32:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:32:45,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-10-24 23:32:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:45,082 INFO L225 Difference]: With dead ends: 4873 [2018-10-24 23:32:45,083 INFO L226 Difference]: Without dead ends: 3275 [2018-10-24 23:32:45,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:32:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-24 23:32:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-24 23:32:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-24 23:32:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5451 transitions. [2018-10-24 23:32:45,225 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5451 transitions. Word has length 102 [2018-10-24 23:32:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:45,225 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 5451 transitions. [2018-10-24 23:32:45,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:32:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5451 transitions. [2018-10-24 23:32:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 23:32:45,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:45,231 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:32:45,231 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:45,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2031355331, now seen corresponding path program 1 times [2018-10-24 23:32:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:45,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:45,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:45,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:45,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:45,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:32:45,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:45,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:32:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:32:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:45,494 INFO L87 Difference]: Start difference. First operand 3241 states and 5451 transitions. Second operand 6 states. [2018-10-24 23:32:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:59,904 INFO L93 Difference]: Finished difference Result 9767 states and 16545 transitions. [2018-10-24 23:32:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:32:59,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-10-24 23:32:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:59,947 INFO L225 Difference]: With dead ends: 9767 [2018-10-24 23:32:59,947 INFO L226 Difference]: Without dead ends: 6532 [2018-10-24 23:32:59,961 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-24 23:32:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2018-10-24 23:33:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6456. [2018-10-24 23:33:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6456 states. [2018-10-24 23:33:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6456 states to 6456 states and 10247 transitions. [2018-10-24 23:33:00,177 INFO L78 Accepts]: Start accepts. Automaton has 6456 states and 10247 transitions. Word has length 115 [2018-10-24 23:33:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:00,178 INFO L481 AbstractCegarLoop]: Abstraction has 6456 states and 10247 transitions. [2018-10-24 23:33:00,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6456 states and 10247 transitions. [2018-10-24 23:33:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 23:33:00,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:00,190 INFO L375 BasicCegarLoop]: trace histogram [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-24 23:33:00,190 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:00,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -381568314, now seen corresponding path program 1 times [2018-10-24 23:33:00,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:00,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:00,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:00,543 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:00,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:00,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:00,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:00,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:00,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:00,664 INFO L87 Difference]: Start difference. First operand 6456 states and 10247 transitions. Second operand 6 states. [2018-10-24 23:33:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:09,218 INFO L93 Difference]: Finished difference Result 18070 states and 29703 transitions. [2018-10-24 23:33:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:09,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-24 23:33:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:09,278 INFO L225 Difference]: With dead ends: 18070 [2018-10-24 23:33:09,278 INFO L226 Difference]: Without dead ends: 11620 [2018-10-24 23:33:09,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:33:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11620 states. [2018-10-24 23:33:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11620 to 11438. [2018-10-24 23:33:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11438 states. [2018-10-24 23:33:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11438 states to 11438 states and 17980 transitions. [2018-10-24 23:33:09,756 INFO L78 Accepts]: Start accepts. Automaton has 11438 states and 17980 transitions. Word has length 120 [2018-10-24 23:33:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:09,757 INFO L481 AbstractCegarLoop]: Abstraction has 11438 states and 17980 transitions. [2018-10-24 23:33:09,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 11438 states and 17980 transitions. [2018-10-24 23:33:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-24 23:33:09,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:09,759 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:09,761 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:09,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1903682250, now seen corresponding path program 1 times [2018-10-24 23:33:09,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:09,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:09,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:09,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:09,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:10,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:10,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:10,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:10,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:10,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:10,033 INFO L87 Difference]: Start difference. First operand 11438 states and 17980 transitions. Second operand 6 states. [2018-10-24 23:33:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:34,450 INFO L93 Difference]: Finished difference Result 46378 states and 82604 transitions. [2018-10-24 23:33:34,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 23:33:34,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-10-24 23:33:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:34,632 INFO L225 Difference]: With dead ends: 46378 [2018-10-24 23:33:34,632 INFO L226 Difference]: Without dead ends: 34946 [2018-10-24 23:33:34,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 23:33:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34946 states. [2018-10-24 23:33:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34946 to 34659. [2018-10-24 23:33:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34659 states. [2018-10-24 23:33:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34659 states to 34659 states and 54020 transitions. [2018-10-24 23:33:35,712 INFO L78 Accepts]: Start accepts. Automaton has 34659 states and 54020 transitions. Word has length 128 [2018-10-24 23:33:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:35,713 INFO L481 AbstractCegarLoop]: Abstraction has 34659 states and 54020 transitions. [2018-10-24 23:33:35,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 34659 states and 54020 transitions. [2018-10-24 23:33:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 23:33:35,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:35,715 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:35,716 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:35,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 367290207, now seen corresponding path program 1 times [2018-10-24 23:33:35,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:35,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:35,991 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:36,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:36,381 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:36,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:36,382 INFO L87 Difference]: Start difference. First operand 34659 states and 54020 transitions. Second operand 6 states. [2018-10-24 23:33:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:45,208 INFO L93 Difference]: Finished difference Result 84446 states and 141428 transitions. [2018-10-24 23:33:45,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:45,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-24 23:33:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:45,445 INFO L225 Difference]: With dead ends: 84446 [2018-10-24 23:33:45,445 INFO L226 Difference]: Without dead ends: 49793 [2018-10-24 23:33:45,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:33:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49793 states. [2018-10-24 23:33:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49793 to 49432. [2018-10-24 23:33:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49432 states. [2018-10-24 23:33:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49432 states to 49432 states and 75484 transitions. [2018-10-24 23:33:46,765 INFO L78 Accepts]: Start accepts. Automaton has 49432 states and 75484 transitions. Word has length 149 [2018-10-24 23:33:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:46,765 INFO L481 AbstractCegarLoop]: Abstraction has 49432 states and 75484 transitions. [2018-10-24 23:33:46,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 49432 states and 75484 transitions. [2018-10-24 23:33:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 23:33:46,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:46,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:46,769 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:46,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1017513474, now seen corresponding path program 1 times [2018-10-24 23:33:46,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:46,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:46,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:47,032 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:33:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:33:47,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:33:47,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-24 23:33:47,288 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1959], [1961], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:33:47,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:33:47,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:33:49,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:33:49,291 INFO L272 AbstractInterpreter]: Visited 153 different actions 300 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:33:49,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:49,333 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:33:50,393 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 78.73% of their original sizes. [2018-10-24 23:33:50,394 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:33:51,139 INFO L413 sIntCurrentIteration]: We have 169 unified AI predicates [2018-10-24 23:33:51,139 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:33:51,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:33:51,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 23:33:51,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:51,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:33:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:33:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:33:51,142 INFO L87 Difference]: Start difference. First operand 49432 states and 75484 transitions. Second operand 14 states. [2018-10-24 23:34:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 23:34:46,318 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: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.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.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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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-24 23:34:46,323 INFO L168 Benchmark]: Toolchain (without parser) took 163718.31 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 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 574.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,324 INFO L168 Benchmark]: CDTParser took 0.20 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-24 23:34:46,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2115.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 441.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,327 INFO L168 Benchmark]: Boogie Preprocessor took 318.55 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: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,328 INFO L168 Benchmark]: RCFGBuilder took 13544.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -191.9 MB). Peak memory consumption was 660.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,329 INFO L168 Benchmark]: TraceAbstraction took 147289.03 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 3.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 588.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:46,335 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.20 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 2115.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 441.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 318.55 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: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13544.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -191.9 MB). Peak memory consumption was 660.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147289.03 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 3.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 588.0 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...