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_label14_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:41:34,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:41:34,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:41:34,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:41:34,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:41:34,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:41:34,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:41:34,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:41:34,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:41:34,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:41:34,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:41:34,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:41:34,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:41:34,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:41:34,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:41:34,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:41:34,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:41:34,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:41:34,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:41:34,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:41:34,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:41:34,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:41:34,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:41:34,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:41:34,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:41:34,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:41:34,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:41:34,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:41:34,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:41:34,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:41:34,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:41:34,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:41:34,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:41:34,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:41:34,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:41:34,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:41:34,342 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:41:34,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:41:34,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:41:34,373 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:41:34,373 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:41:34,374 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:41:34,374 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:41:34,374 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:41:34,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:41:34,374 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:41:34,375 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:41:34,375 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:41:34,375 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:41:34,375 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:41:34,375 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:41:34,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:41:34,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:41:34,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:41:34,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:41:34,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:41:34,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:41:34,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:41:34,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:41:34,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:41:34,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:41:34,381 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:41:34,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:41:34,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:41:34,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:41:34,382 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:41:34,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:41:34,382 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:41:34,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:41:34,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:41:34,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:41:34,384 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:41:34,384 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:41:34,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:41:34,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:41:34,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:41:34,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:41:34,453 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:41:34,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label14_true-unreach-call.c [2018-10-25 01:41:34,507 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/369ecae7b/6f4cb8fee77744d8ab400251dcb79f56/FLAG1de05b061 [2018-10-25 01:41:35,261 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:41:35,262 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label14_true-unreach-call.c [2018-10-25 01:41:35,303 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/369ecae7b/6f4cb8fee77744d8ab400251dcb79f56/FLAG1de05b061 [2018-10-25 01:41:35,318 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/369ecae7b/6f4cb8fee77744d8ab400251dcb79f56 [2018-10-25 01:41:35,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:41:35,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:41:35,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:35,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:41:35,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:41:35,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:35" (1/1) ... [2018-10-25 01:41:35,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31986504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:35, skipping insertion in model container [2018-10-25 01:41:35,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:35" (1/1) ... [2018-10-25 01:41:35,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:41:35,509 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:41:37,012 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:37,017 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:41:37,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:37,828 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:41:37,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37 WrapperNode [2018-10-25 01:41:37,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:37,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:37,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:41:37,830 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:41:37,840 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:41:37" (1/1) ... [2018-10-25 01:41:37,949 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:41:37" (1/1) ... [2018-10-25 01:41:38,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:38,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:41:38,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:41:38,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:41:38,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (1/1) ... [2018-10-25 01:41:38,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:41:38,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:41:38,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:41:38,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:41:38,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (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:41:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:41:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:41:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:41:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:41:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:41:38,890 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:41:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:41:38,890 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:41:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:41:38,891 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:41:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:41:38,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:41:38,892 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:41:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:41:49,533 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:41:49,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:49 BoogieIcfgContainer [2018-10-25 01:41:49,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:41:49,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:41:49,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:41:49,539 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:41:49,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:41:35" (1/3) ... [2018-10-25 01:41:49,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48905866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:49, skipping insertion in model container [2018-10-25 01:41:49,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:37" (2/3) ... [2018-10-25 01:41:49,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48905866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:49, skipping insertion in model container [2018-10-25 01:41:49,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:49" (3/3) ... [2018-10-25 01:41:49,542 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label14_true-unreach-call.c [2018-10-25 01:41:49,553 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:41:49,563 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:41:49,581 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:41:49,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:41:49,629 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:41:49,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:41:49,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:41:49,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:41:49,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:41:49,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:41:49,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:41:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:41:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-25 01:41:49,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:49,683 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] [2018-10-25 01:41:49,685 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:49,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash 963614956, now seen corresponding path program 1 times [2018-10-25 01:41:49,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:49,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:49,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:49,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:49,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:50,226 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:50,339 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:50,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:50,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:41:50,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:50,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:41:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:41:50,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:41:50,368 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:41:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:58,740 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-25 01:41:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:41:58,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-10-25 01:41:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:58,784 INFO L225 Difference]: With dead ends: 3097 [2018-10-25 01:41:58,785 INFO L226 Difference]: Without dead ends: 1975 [2018-10-25 01:41:58,799 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:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-25 01:41:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-25 01:41:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-25 01:41:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-25 01:41:58,970 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 48 [2018-10-25 01:41:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:58,972 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-25 01:41:58,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:41:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-25 01:41:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:41:58,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:58,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,985 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:58,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1268878372, now seen corresponding path program 1 times [2018-10-25 01:41:58,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:58,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:59,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:59,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:59,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:59,281 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-25 01:42:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:23,051 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-10-25 01:42:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:23,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-25 01:42:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:23,076 INFO L225 Difference]: With dead ends: 5736 [2018-10-25 01:42:23,077 INFO L226 Difference]: Without dead ends: 3768 [2018-10-25 01:42:23,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-10-25 01:42:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-10-25 01:42:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-10-25 01:42:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-10-25 01:42:23,209 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 124 [2018-10-25 01:42:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:23,209 INFO L481 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-10-25 01:42:23,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-10-25 01:42:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:42:23,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:23,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,216 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:23,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash -594329152, now seen corresponding path program 1 times [2018-10-25 01:42:23,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:23,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:23,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:23,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:42:23,483 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:23,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:42:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:42:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:42:23,484 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-10-25 01:42:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:50,593 INFO L93 Difference]: Finished difference Result 13666 states and 21762 transitions. [2018-10-25 01:42:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:50,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-10-25 01:42:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:50,653 INFO L225 Difference]: With dead ends: 13666 [2018-10-25 01:42:50,653 INFO L226 Difference]: Without dead ends: 9986 [2018-10-25 01:42:50,678 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:42:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-10-25 01:42:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9796. [2018-10-25 01:42:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9796 states. [2018-10-25 01:42:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 14502 transitions. [2018-10-25 01:42:50,940 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 14502 transitions. Word has length 138 [2018-10-25 01:42:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:50,940 INFO L481 AbstractCegarLoop]: Abstraction has 9796 states and 14502 transitions. [2018-10-25 01:42:50,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 14502 transitions. [2018-10-25 01:42:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 01:42:50,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:50,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,946 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:50,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -221189476, now seen corresponding path program 1 times [2018-10-25 01:42:50,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:50,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:50,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:50,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:50,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:51,236 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:51,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:51,357 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:51,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:51,358 INFO L87 Difference]: Start difference. First operand 9796 states and 14502 transitions. Second operand 6 states. [2018-10-25 01:43:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:04,830 INFO L93 Difference]: Finished difference Result 34194 states and 53805 transitions. [2018-10-25 01:43:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:04,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 01:43:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:04,953 INFO L225 Difference]: With dead ends: 34194 [2018-10-25 01:43:04,953 INFO L226 Difference]: Without dead ends: 24404 [2018-10-25 01:43:05,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:43:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24404 states. [2018-10-25 01:43:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24404 to 24171. [2018-10-25 01:43:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24171 states. [2018-10-25 01:43:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24171 states to 24171 states and 34070 transitions. [2018-10-25 01:43:05,599 INFO L78 Accepts]: Start accepts. Automaton has 24171 states and 34070 transitions. Word has length 156 [2018-10-25 01:43:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:05,600 INFO L481 AbstractCegarLoop]: Abstraction has 24171 states and 34070 transitions. [2018-10-25 01:43:05,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24171 states and 34070 transitions. [2018-10-25 01:43:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-25 01:43:05,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:05,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,606 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1233336343, now seen corresponding path program 1 times [2018-10-25 01:43:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:05,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:05,900 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:06,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:06,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:06,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:06,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:06,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:06,035 INFO L87 Difference]: Start difference. First operand 24171 states and 34070 transitions. Second operand 6 states. [2018-10-25 01:43:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:18,217 INFO L93 Difference]: Finished difference Result 62332 states and 97806 transitions. [2018-10-25 01:43:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:18,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-25 01:43:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:18,382 INFO L225 Difference]: With dead ends: 62332 [2018-10-25 01:43:18,382 INFO L226 Difference]: Without dead ends: 38167 [2018-10-25 01:43:18,434 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:43:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38167 states. [2018-10-25 01:43:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38167 to 37970. [2018-10-25 01:43:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37970 states. [2018-10-25 01:43:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37970 states to 37970 states and 54391 transitions. [2018-10-25 01:43:19,276 INFO L78 Accepts]: Start accepts. Automaton has 37970 states and 54391 transitions. Word has length 167 [2018-10-25 01:43:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:19,276 INFO L481 AbstractCegarLoop]: Abstraction has 37970 states and 54391 transitions. [2018-10-25 01:43:19,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37970 states and 54391 transitions. [2018-10-25 01:43:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 01:43:19,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:19,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:19,283 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:19,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1930020088, now seen corresponding path program 1 times [2018-10-25 01:43:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:19,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:19,572 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:19,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:19,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:19,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:19,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:19,982 INFO L87 Difference]: Start difference. First operand 37970 states and 54391 transitions. Second operand 6 states. [2018-10-25 01:43:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:31,362 INFO L93 Difference]: Finished difference Result 83923 states and 123738 transitions. [2018-10-25 01:43:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:31,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-10-25 01:43:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:31,520 INFO L225 Difference]: With dead ends: 83923 [2018-10-25 01:43:31,520 INFO L226 Difference]: Without dead ends: 45959 [2018-10-25 01:43:31,606 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:43:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45959 states. [2018-10-25 01:43:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45959 to 45857. [2018-10-25 01:43:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45857 states. [2018-10-25 01:43:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45857 states to 45857 states and 62616 transitions. [2018-10-25 01:43:32,415 INFO L78 Accepts]: Start accepts. Automaton has 45857 states and 62616 transitions. Word has length 195 [2018-10-25 01:43:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:32,416 INFO L481 AbstractCegarLoop]: Abstraction has 45857 states and 62616 transitions. [2018-10-25 01:43:32,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 45857 states and 62616 transitions. [2018-10-25 01:43:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-25 01:43:32,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:32,431 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:43:32,431 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:32,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:32,431 INFO L82 PathProgramCache]: Analyzing trace with hash -559903430, now seen corresponding path program 1 times [2018-10-25 01:43:32,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:32,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:32,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:32,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:43:32,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:43:32,987 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-10-25 01:43:32,989 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], [2911], [2913], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [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:43:33,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:43:33,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:43:33,754 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:43:33,756 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:43:33,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:33,790 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:43:34,343 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 71.26% of their original sizes. [2018-10-25 01:43:34,344 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:43:34,620 INFO L413 sIntCurrentIteration]: We have 244 unified AI predicates [2018-10-25 01:43:34,621 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:43:34,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:43:34,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:43:34,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:34,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:34,623 INFO L87 Difference]: Start difference. First operand 45857 states and 62616 transitions. Second operand 6 states. [2018-10-25 01:43:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:43:38,673 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:43:38,684 INFO L168 Benchmark]: Toolchain (without parser) took 123354.24 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -177.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,686 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:43:38,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2497.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 600.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,690 INFO L168 Benchmark]: Boogie Preprocessor took 387.62 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,691 INFO L168 Benchmark]: RCFGBuilder took 10715.76 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 21.6 MB). Peak memory consumption was 662.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,692 INFO L168 Benchmark]: TraceAbstraction took 109148.20 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 706.2 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 607.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:38,700 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.23 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 2497.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 600.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 387.62 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10715.76 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 21.6 MB). Peak memory consumption was 662.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109148.20 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 706.2 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 607.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...