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/Problem13_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:40:43,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:40:43,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:40:43,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:40:43,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:40:43,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:40:43,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:40:43,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:40:43,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:40:43,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:40:43,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:40:43,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:40:43,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:40:43,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:40:43,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:40:43,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:40:43,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:40:43,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:40:43,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:40:43,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:40:43,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:40:43,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:40:43,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:40:43,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:40:43,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:40:43,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:40:43,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:40:43,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:40:43,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:40:43,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:40:43,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:40:43,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:40:43,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:40:43,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:40:43,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:40:43,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:40:43,521 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:40:43,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:40:43,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:40:43,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:40:43,538 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:40:43,538 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:40:43,539 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:40:43,539 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:40:43,539 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:40:43,539 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:40:43,539 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:40:43,539 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:40:43,540 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:40:43,540 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:40:43,540 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:40:43,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:40:43,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:40:43,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:40:43,541 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:40:43,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:40:43,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:40:43,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:40:43,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:40:43,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:40:43,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:40:43,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:40:43,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:40:43,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:40:43,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:40:43,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:40:43,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:40:43,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:40:43,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:40:43,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:40:43,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:40:43,546 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:40:43,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:40:43,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:40:43,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:40:43,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:40:43,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:40:43,646 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:40:43,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label01_true-unreach-call.c [2018-10-25 01:40:43,709 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/82927199c/cf05a82466a346c6a5697ac314d57e0a/FLAGf77cfb5c5 [2018-10-25 01:40:44,560 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:40:44,561 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label01_true-unreach-call.c [2018-10-25 01:40:44,600 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/82927199c/cf05a82466a346c6a5697ac314d57e0a/FLAGf77cfb5c5 [2018-10-25 01:40:44,625 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/82927199c/cf05a82466a346c6a5697ac314d57e0a [2018-10-25 01:40:44,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:40:44,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:40:44,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:44,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:40:44,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:40:44,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:44" (1/1) ... [2018-10-25 01:40:44,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4e31e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:44, skipping insertion in model container [2018-10-25 01:40:44,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:44" (1/1) ... [2018-10-25 01:40:44,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:40:44,879 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:40:46,412 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:46,418 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:40:47,168 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:47,204 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:40:47,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47 WrapperNode [2018-10-25 01:40:47,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:47,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:47,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:40:47,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:40:47,216 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:40:47" (1/1) ... [2018-10-25 01:40:47,303 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:40:47" (1/1) ... [2018-10-25 01:40:47,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:47,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:40:47,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:40:47,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:40:47,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:47,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:47,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:47,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:48,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:48,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:48,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (1/1) ... [2018-10-25 01:40:48,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:40:48,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:40:48,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:40:48,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:40:48,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (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:40:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:40:48,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:40:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:40:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:40:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:40:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:40:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:40:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:40:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:40:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:40:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:40:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:40:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:40:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:40:59,832 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:40:59,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:59 BoogieIcfgContainer [2018-10-25 01:40:59,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:40:59,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:40:59,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:40:59,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:40:59,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:40:44" (1/3) ... [2018-10-25 01:40:59,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476a6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:59, skipping insertion in model container [2018-10-25 01:40:59,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:47" (2/3) ... [2018-10-25 01:40:59,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476a6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:59, skipping insertion in model container [2018-10-25 01:40:59,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:59" (3/3) ... [2018-10-25 01:40:59,843 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label01_true-unreach-call.c [2018-10-25 01:40:59,853 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:40:59,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:40:59,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:40:59,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:40:59,930 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:40:59,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:40:59,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:40:59,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:40:59,930 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:40:59,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:40:59,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:40:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:40:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 01:40:59,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:59,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:59,990 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:59,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 980545676, now seen corresponding path program 1 times [2018-10-25 01:40:59,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:00,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:00,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:00,572 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:00,755 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:41:00,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:41:00,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:00,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:41:00,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:41:00,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:41:00,792 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:41:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:09,893 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-25 01:41:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:41:09,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-25 01:41:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:09,934 INFO L225 Difference]: With dead ends: 3097 [2018-10-25 01:41:09,934 INFO L226 Difference]: Without dead ends: 1975 [2018-10-25 01:41:09,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 01:41:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-25 01:41:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-25 01:41:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-25 01:41:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-25 01:41:10,113 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 56 [2018-10-25 01:41:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:10,114 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-25 01:41:10,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:41:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-25 01:41:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:41:10,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:10,122 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:10,123 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:10,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1287580412, now seen corresponding path program 1 times [2018-10-25 01:41:10,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:10,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:10,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:10,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:10,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:10,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:10,369 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-25 01:41:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:31,666 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-10-25 01:41:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:41:31,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 01:41:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:31,692 INFO L225 Difference]: With dead ends: 5736 [2018-10-25 01:41:31,692 INFO L226 Difference]: Without dead ends: 3768 [2018-10-25 01:41:31,700 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-25 01:41:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-10-25 01:41:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-10-25 01:41:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-10-25 01:41:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-10-25 01:41:31,820 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 132 [2018-10-25 01:41:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:31,820 INFO L481 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-10-25 01:41:31,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:41:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-10-25 01:41:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-25 01:41:31,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:31,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:31,832 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:31,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash 800617696, now seen corresponding path program 1 times [2018-10-25 01:41:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:31,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:31,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:32,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:32,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:32,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:32,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:32,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:32,102 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-10-25 01:41:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:59,692 INFO L93 Difference]: Finished difference Result 13666 states and 21761 transitions. [2018-10-25 01:41:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:41:59,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-10-25 01:41:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:59,747 INFO L225 Difference]: With dead ends: 13666 [2018-10-25 01:41:59,748 INFO L226 Difference]: Without dead ends: 9986 [2018-10-25 01:41:59,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:41:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-10-25 01:42:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9796. [2018-10-25 01:42:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9796 states. [2018-10-25 01:42:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 14501 transitions. [2018-10-25 01:42:00,035 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 14501 transitions. Word has length 146 [2018-10-25 01:42:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:00,036 INFO L481 AbstractCegarLoop]: Abstraction has 9796 states and 14501 transitions. [2018-10-25 01:42:00,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 14501 transitions. [2018-10-25 01:42:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 01:42:00,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:00,042 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:00,042 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:00,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2020564548, now seen corresponding path program 1 times [2018-10-25 01:42:00,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:00,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:00,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:00,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:00,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:00,314 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:00,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:00,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:00,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:00,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:00,499 INFO L87 Difference]: Start difference. First operand 9796 states and 14501 transitions. Second operand 6 states. [2018-10-25 01:42:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:14,994 INFO L93 Difference]: Finished difference Result 34190 states and 53778 transitions. [2018-10-25 01:42:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:14,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 01:42:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:15,115 INFO L225 Difference]: With dead ends: 34190 [2018-10-25 01:42:15,116 INFO L226 Difference]: Without dead ends: 24400 [2018-10-25 01:42:15,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2018-10-25 01:42:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 24167. [2018-10-25 01:42:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24167 states. [2018-10-25 01:42:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 34058 transitions. [2018-10-25 01:42:15,779 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 34058 transitions. Word has length 164 [2018-10-25 01:42:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:15,780 INFO L481 AbstractCegarLoop]: Abstraction has 24167 states and 34058 transitions. [2018-10-25 01:42:15,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 34058 transitions. [2018-10-25 01:42:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-25 01:42:15,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:15,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:15,787 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:15,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -744065737, now seen corresponding path program 1 times [2018-10-25 01:42:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:15,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:15,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:16,108 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:16,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:16,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:16,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:16,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:16,308 INFO L87 Difference]: Start difference. First operand 24167 states and 34058 transitions. Second operand 6 states. [2018-10-25 01:42:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:27,313 INFO L93 Difference]: Finished difference Result 62338 states and 97841 transitions. [2018-10-25 01:42:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:27,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-10-25 01:42:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:27,491 INFO L225 Difference]: With dead ends: 62338 [2018-10-25 01:42:27,491 INFO L226 Difference]: Without dead ends: 38177 [2018-10-25 01:42:27,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38177 states. [2018-10-25 01:42:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38177 to 37980. [2018-10-25 01:42:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37980 states. [2018-10-25 01:42:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37980 states to 37980 states and 54438 transitions. [2018-10-25 01:42:28,543 INFO L78 Accepts]: Start accepts. Automaton has 37980 states and 54438 transitions. Word has length 175 [2018-10-25 01:42:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:28,544 INFO L481 AbstractCegarLoop]: Abstraction has 37980 states and 54438 transitions. [2018-10-25 01:42:28,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37980 states and 54438 transitions. [2018-10-25 01:42:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-25 01:42:28,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:28,553 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:28,553 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:28,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 787887912, now seen corresponding path program 1 times [2018-10-25 01:42:28,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:28,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:28,862 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:29,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:29,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:29,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:29,254 INFO L87 Difference]: Start difference. First operand 37980 states and 54438 transitions. Second operand 6 states. [2018-10-25 01:42:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:40,438 INFO L93 Difference]: Finished difference Result 83936 states and 123834 transitions. [2018-10-25 01:42:40,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:40,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2018-10-25 01:42:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:40,608 INFO L225 Difference]: With dead ends: 83936 [2018-10-25 01:42:40,609 INFO L226 Difference]: Without dead ends: 45962 [2018-10-25 01:42:40,697 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-25 01:42:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45962 states. [2018-10-25 01:42:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45962 to 45860. [2018-10-25 01:42:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2018-10-25 01:42:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 62659 transitions. [2018-10-25 01:42:41,620 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 62659 transitions. Word has length 203 [2018-10-25 01:42:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:41,620 INFO L481 AbstractCegarLoop]: Abstraction has 45860 states and 62659 transitions. [2018-10-25 01:42:41,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 62659 transitions. [2018-10-25 01:42:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-25 01:42:41,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:41,645 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:42:41,645 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:41,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:41,645 INFO L82 PathProgramCache]: Analyzing trace with hash 334178010, now seen corresponding path program 1 times [2018-10-25 01:42:41,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:41,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:41,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:41,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:42,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:42,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:42,183 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-10-25 01:42:42,186 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2975], [2977], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:42:42,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:42,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:42,958 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:42:42,959 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:42:42,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:42,988 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:42:43,662 INFO L232 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 71.38% of their original sizes. [2018-10-25 01:42:43,663 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:42:43,890 INFO L413 sIntCurrentIteration]: We have 252 unified AI predicates [2018-10-25 01:42:43,893 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:42:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:42:43,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:42:43,894 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:43,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:43,896 INFO L87 Difference]: Start difference. First operand 45860 states and 62659 transitions. Second operand 6 states. [2018-10-25 01:42:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:42:48,192 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:42:48,203 INFO L168 Benchmark]: Toolchain (without parser) took 123564.21 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.7 GB). Free memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: -209.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,207 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:42:48,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2562.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 588.05 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 768.6 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,214 INFO L168 Benchmark]: Boogie Preprocessor took 428.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,215 INFO L168 Benchmark]: RCFGBuilder took 11610.23 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 215.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -46.9 MB). Peak memory consumption was 680.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,216 INFO L168 Benchmark]: TraceAbstraction took 108367.55 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 682.1 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 588.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-25 01:42:48,229 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2562.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 588.05 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 768.6 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 428.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11610.23 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 215.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -46.9 MB). Peak memory consumption was 680.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108367.55 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 682.1 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 588.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...