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/Problem18_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:07:33,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:07:33,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:07:33,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:07:33,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:07:33,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:07:33,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:07:33,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:07:33,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:07:33,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:07:33,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:07:33,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:07:33,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:07:33,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:07:33,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:07:33,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:07:33,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:07:33,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:07:33,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:07:33,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:07:33,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:07:33,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:07:33,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:07:33,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:07:33,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:07:33,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:07:33,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:07:33,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:07:33,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:07:33,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:07:33,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:07:33,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:07:33,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:07:33,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:07:33,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:07:33,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:07:33,396 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 02:07:33,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:07:33,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:07:33,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:07:33,424 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:07:33,425 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:07:33,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:07:33,425 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:07:33,425 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:07:33,425 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:07:33,425 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:07:33,426 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:07:33,427 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:07:33,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:07:33,427 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:07:33,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:07:33,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:07:33,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:07:33,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:07:33,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:07:33,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:07:33,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:07:33,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:07:33,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:07:33,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:07:33,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:07:33,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:07:33,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:07:33,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:07:33,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:07:33,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:07:33,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:07:33,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:07:33,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:07:33,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:07:33,434 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:07:33,434 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:07:33,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:07:33,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:07:33,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:07:33,517 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:07:33,517 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:07:33,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label50_true-unreach-call.c [2018-10-25 02:07:33,576 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9022de15d/287361f00ccb4a0d821bf24e06f7cd97/FLAGb6a27aaeb [2018-10-25 02:07:34,318 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:07:34,319 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label50_true-unreach-call.c [2018-10-25 02:07:34,347 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9022de15d/287361f00ccb4a0d821bf24e06f7cd97/FLAGb6a27aaeb [2018-10-25 02:07:34,362 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9022de15d/287361f00ccb4a0d821bf24e06f7cd97 [2018-10-25 02:07:34,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:07:34,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:07:34,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:34,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:07:34,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:07:34,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:34" (1/1) ... [2018-10-25 02:07:34,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc31ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:34, skipping insertion in model container [2018-10-25 02:07:34,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:34" (1/1) ... [2018-10-25 02:07:34,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:07:34,529 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:07:35,663 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:35,667 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:07:36,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:36,137 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:07:36,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36 WrapperNode [2018-10-25 02:07:36,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:36,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:36,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:07:36,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:07:36,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:36,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:07:36,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:07:36,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:07:36,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (1/1) ... [2018-10-25 02:07:36,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:07:36,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:07:36,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:07:36,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:07:36,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (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 02:07:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:07:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:07:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:07:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:07:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:07:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:07:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:07:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:07:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:07:36,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:07:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:07:36,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:07:45,513 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:07:45,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:45 BoogieIcfgContainer [2018-10-25 02:07:45,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:07:45,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:07:45,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:07:45,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:07:45,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:07:34" (1/3) ... [2018-10-25 02:07:45,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8c0447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:45, skipping insertion in model container [2018-10-25 02:07:45,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:36" (2/3) ... [2018-10-25 02:07:45,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8c0447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:45, skipping insertion in model container [2018-10-25 02:07:45,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:45" (3/3) ... [2018-10-25 02:07:45,525 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label50_true-unreach-call.c [2018-10-25 02:07:45,535 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:07:45,546 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:07:45,565 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:07:45,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:07:45,613 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:07:45,613 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:07:45,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:07:45,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:07:45,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:07:45,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:07:45,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:07:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:07:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-25 02:07:45,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:45,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:07:45,673 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:45,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1313897628, now seen corresponding path program 1 times [2018-10-25 02:07:45,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:45,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:45,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:46,265 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:07:46,410 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 02:07:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:07:46,413 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:46,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:07:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:07:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:07:46,440 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-25 02:07:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:07:53,296 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-25 02:07:53,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:07:53,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-25 02:07:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:07:53,350 INFO L225 Difference]: With dead ends: 2251 [2018-10-25 02:07:53,350 INFO L226 Difference]: Without dead ends: 1474 [2018-10-25 02:07:53,367 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 02:07:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-25 02:07:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-25 02:07:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:07:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2721 transitions. [2018-10-25 02:07:53,557 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2721 transitions. Word has length 70 [2018-10-25 02:07:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:07:53,559 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2721 transitions. [2018-10-25 02:07:53,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:07:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2721 transitions. [2018-10-25 02:07:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-25 02:07:53,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:53,575 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:07:53,576 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash -574735317, now seen corresponding path program 1 times [2018-10-25 02:07:53,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:53,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:53,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:53,947 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:07:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:54,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:54,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:07:54,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:54,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:07:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:07:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:07:54,196 INFO L87 Difference]: Start difference. First operand 1474 states and 2721 transitions. Second operand 6 states. [2018-10-25 02:08:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:02,681 INFO L93 Difference]: Finished difference Result 4419 states and 8244 transitions. [2018-10-25 02:08:02,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:02,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2018-10-25 02:08:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:02,713 INFO L225 Difference]: With dead ends: 4419 [2018-10-25 02:08:02,713 INFO L226 Difference]: Without dead ends: 2951 [2018-10-25 02:08:02,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:08:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-10-25 02:08:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2928. [2018-10-25 02:08:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-10-25 02:08:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 5087 transitions. [2018-10-25 02:08:02,812 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 5087 transitions. Word has length 159 [2018-10-25 02:08:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:02,813 INFO L481 AbstractCegarLoop]: Abstraction has 2928 states and 5087 transitions. [2018-10-25 02:08:02,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 5087 transitions. [2018-10-25 02:08:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 02:08:02,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:02,819 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, 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] [2018-10-25 02:08:02,820 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:02,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1205378606, now seen corresponding path program 1 times [2018-10-25 02:08:02,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:02,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:02,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:02,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:02,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:03,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:03,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:03,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:03,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:03,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:03,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:03,124 INFO L87 Difference]: Start difference. First operand 2928 states and 5087 transitions. Second operand 6 states. [2018-10-25 02:08:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:09,221 INFO L93 Difference]: Finished difference Result 6669 states and 11522 transitions. [2018-10-25 02:08:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:09,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 206 [2018-10-25 02:08:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:09,244 INFO L225 Difference]: With dead ends: 6669 [2018-10-25 02:08:09,244 INFO L226 Difference]: Without dead ends: 3747 [2018-10-25 02:08:09,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:08:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2018-10-25 02:08:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3689. [2018-10-25 02:08:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2018-10-25 02:08:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5891 transitions. [2018-10-25 02:08:09,350 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5891 transitions. Word has length 206 [2018-10-25 02:08:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:09,351 INFO L481 AbstractCegarLoop]: Abstraction has 3689 states and 5891 transitions. [2018-10-25 02:08:09,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5891 transitions. [2018-10-25 02:08:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-25 02:08:09,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:09,356 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, 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] [2018-10-25 02:08:09,357 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:09,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 393503562, now seen corresponding path program 1 times [2018-10-25 02:08:09,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:09,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:09,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:09,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:09,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:09,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:09,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:09,610 INFO L87 Difference]: Start difference. First operand 3689 states and 5891 transitions. Second operand 6 states. [2018-10-25 02:08:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:15,463 INFO L93 Difference]: Finished difference Result 9623 states and 15373 transitions. [2018-10-25 02:08:15,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:15,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2018-10-25 02:08:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:15,500 INFO L225 Difference]: With dead ends: 9623 [2018-10-25 02:08:15,500 INFO L226 Difference]: Without dead ends: 5940 [2018-10-25 02:08:15,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:08:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2018-10-25 02:08:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 5889. [2018-10-25 02:08:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5889 states. [2018-10-25 02:08:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5889 states to 5889 states and 8064 transitions. [2018-10-25 02:08:15,682 INFO L78 Accepts]: Start accepts. Automaton has 5889 states and 8064 transitions. Word has length 208 [2018-10-25 02:08:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:15,683 INFO L481 AbstractCegarLoop]: Abstraction has 5889 states and 8064 transitions. [2018-10-25 02:08:15,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5889 states and 8064 transitions. [2018-10-25 02:08:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-25 02:08:15,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:15,690 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, 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, 1, 1, 1, 1, 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 02:08:15,690 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:15,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1692616840, now seen corresponding path program 1 times [2018-10-25 02:08:15,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:15,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:15,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-25 02:08:15,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:15,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:08:15,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:15,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:08:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:08:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:15,985 INFO L87 Difference]: Start difference. First operand 5889 states and 8064 transitions. Second operand 4 states. [2018-10-25 02:08:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:24,473 INFO L93 Difference]: Finished difference Result 22501 states and 31632 transitions. [2018-10-25 02:08:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:08:24,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-10-25 02:08:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:24,555 INFO L225 Difference]: With dead ends: 22501 [2018-10-25 02:08:24,555 INFO L226 Difference]: Without dead ends: 16618 [2018-10-25 02:08:24,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2018-10-25 02:08:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16618. [2018-10-25 02:08:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2018-10-25 02:08:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 21854 transitions. [2018-10-25 02:08:24,981 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 21854 transitions. Word has length 266 [2018-10-25 02:08:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:24,982 INFO L481 AbstractCegarLoop]: Abstraction has 16618 states and 21854 transitions. [2018-10-25 02:08:24,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:08:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 21854 transitions. [2018-10-25 02:08:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-25 02:08:24,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:25,000 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 02:08:25,000 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:25,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1237035280, now seen corresponding path program 1 times [2018-10-25 02:08:25,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:25,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:25,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:25,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:25,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 167 proven. 61 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:08:25,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:08:25,433 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:08:25,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 311 with the following transitions: [2018-10-25 02:08:25,438 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1999], [2007], [2015], [2023], [2031], [2039], [2047], [2055], [2063], [2071], [2079], [2083], [2085], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2264], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2368], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:08:25,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:08:25,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:08:26,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:08:26,099 INFO L272 AbstractInterpreter]: Visited 138 different actions 138 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:08:26,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:26,142 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:08:26,837 INFO L232 lantSequenceWeakener]: Weakened 301 states. On average, predicates are now at 78.08% of their original sizes. [2018-10-25 02:08:26,837 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:08:27,112 INFO L413 sIntCurrentIteration]: We have 309 unified AI predicates [2018-10-25 02:08:27,113 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:08:27,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:08:27,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 02:08:27,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:27,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:27,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:27,116 INFO L87 Difference]: Start difference. First operand 16618 states and 21854 transitions. Second operand 6 states. [2018-10-25 02:08:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:08:30,864 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:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.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 02:08:30,870 INFO L168 Benchmark]: Toolchain (without parser) took 56496.19 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -335.8 MB). Peak memory consumption was 943.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,871 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-25 02:08:30,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1762.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 403.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -969.3 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,874 INFO L168 Benchmark]: Boogie Preprocessor took 214.16 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,875 INFO L168 Benchmark]: RCFGBuilder took 8758.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 488.3 MB). Peak memory consumption was 488.3 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,876 INFO L168 Benchmark]: TraceAbstraction took 45352.02 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: -30.6 MB). Peak memory consumption was 457.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:08:30,881 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 1762.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 403.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -969.3 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 214.16 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8758.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 488.3 MB). Peak memory consumption was 488.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45352.02 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 487.6 MB). Free memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: -30.6 MB). Peak memory consumption was 457.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...