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/Problem14_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:45:17,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:45:17,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:45:17,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:45:17,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:45:17,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:45:17,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:45:17,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:45:17,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:45:17,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:45:17,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:45:17,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:45:17,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:45:17,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:45:17,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:45:17,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:45:17,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:45:17,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:45:17,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:45:17,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:45:17,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:45:17,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:45:17,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:45:17,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:45:17,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:45:17,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:45:17,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:45:17,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:45:17,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:45:17,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:45:17,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:45:17,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:45:17,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:45:17,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:45:17,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:45:17,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:45:17,507 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:45:17,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:45:17,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:45:17,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:45:17,535 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:45:17,535 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:45:17,535 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:45:17,535 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:45:17,536 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:45:17,536 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:45:17,536 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:45:17,536 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:45:17,536 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:45:17,537 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:45:17,539 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:45:17,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:45:17,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:45:17,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:45:17,541 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:45:17,541 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:45:17,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:45:17,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:45:17,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:45:17,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:45:17,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:45:17,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:45:17,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:45:17,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:45:17,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:45:17,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:45:17,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:45:17,544 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:45:17,544 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:45:17,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:45:17,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:45:17,545 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:45:17,545 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:45:17,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:45:17,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:45:17,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:45:17,615 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:45:17,615 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:45:17,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-10-25 01:45:17,671 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7a573960/8b7465176d2e45bdb2a07400f2628cd8/FLAG8156b304f [2018-10-25 01:45:18,292 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:45:18,292 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-10-25 01:45:18,316 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7a573960/8b7465176d2e45bdb2a07400f2628cd8/FLAG8156b304f [2018-10-25 01:45:18,340 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7a573960/8b7465176d2e45bdb2a07400f2628cd8 [2018-10-25 01:45:18,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:45:18,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:45:18,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:45:18,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:45:18,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:45:18,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:45:18" (1/1) ... [2018-10-25 01:45:18,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a8effd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:18, skipping insertion in model container [2018-10-25 01:45:18,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:45:18" (1/1) ... [2018-10-25 01:45:18,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:45:18,460 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:45:18,945 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:45:18,949 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:45:19,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:45:19,135 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:45:19,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19 WrapperNode [2018-10-25 01:45:19,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:45:19,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:45:19,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:45:19,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:45:19,148 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:45:19" (1/1) ... [2018-10-25 01:45:19,179 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:45:19" (1/1) ... [2018-10-25 01:45:19,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:45:19,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:45:19,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:45:19,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:45:19,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (1/1) ... [2018-10-25 01:45:19,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:45:19,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:45:19,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:45:19,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:45:19,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (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:45:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:45:19,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:45:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:45:19,566 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:45:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:45:19,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:45:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:45:19,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:45:23,413 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:45:23,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:45:23 BoogieIcfgContainer [2018-10-25 01:45:23,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:45:23,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:45:23,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:45:23,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:45:23,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:45:18" (1/3) ... [2018-10-25 01:45:23,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55525b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:45:23, skipping insertion in model container [2018-10-25 01:45:23,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:19" (2/3) ... [2018-10-25 01:45:23,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55525b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:45:23, skipping insertion in model container [2018-10-25 01:45:23,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:45:23" (3/3) ... [2018-10-25 01:45:23,426 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05_true-unreach-call_false-termination.c [2018-10-25 01:45:23,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:45:23,453 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:45:23,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:45:23,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:45:23,521 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:45:23,521 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:45:23,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:45:23,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:45:23,522 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:45:23,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:45:23,522 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:45:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-25 01:45:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-25 01:45:23,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:23,568 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 01:45:23,570 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:23,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 638958820, now seen corresponding path program 1 times [2018-10-25 01:45:23,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:23,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:24,122 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:45:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:45:24,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:24,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:45:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:45:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:24,151 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-10-25 01:45:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:25,662 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-10-25 01:45:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:45:25,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-25 01:45:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:25,685 INFO L225 Difference]: With dead ends: 691 [2018-10-25 01:45:25,685 INFO L226 Difference]: Without dead ends: 434 [2018-10-25 01:45:25,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-25 01:45:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-10-25 01:45:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-25 01:45:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-10-25 01:45:25,779 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 70 [2018-10-25 01:45:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:25,780 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-10-25 01:45:25,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:45:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-10-25 01:45:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:45:25,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:25,789 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] [2018-10-25 01:45:25,790 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:25,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 781618536, now seen corresponding path program 1 times [2018-10-25 01:45:25,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:25,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:25,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:25,792 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:26,118 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 01:45:26,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:26,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:26,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:26,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:26,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:26,122 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-10-25 01:45:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:30,170 INFO L93 Difference]: Finished difference Result 1588 states and 2935 transitions. [2018-10-25 01:45:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:30,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-25 01:45:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:30,181 INFO L225 Difference]: With dead ends: 1588 [2018-10-25 01:45:30,181 INFO L226 Difference]: Without dead ends: 1160 [2018-10-25 01:45:30,186 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 01:45:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-10-25 01:45:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1153. [2018-10-25 01:45:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-25 01:45:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1887 transitions. [2018-10-25 01:45:30,257 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1887 transitions. Word has length 140 [2018-10-25 01:45:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:30,257 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1887 transitions. [2018-10-25 01:45:30,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1887 transitions. [2018-10-25 01:45:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 01:45:30,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:30,262 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] [2018-10-25 01:45:30,262 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:30,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:30,263 INFO L82 PathProgramCache]: Analyzing trace with hash 386881263, now seen corresponding path program 1 times [2018-10-25 01:45:30,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:30,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:30,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:30,489 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 01:45:30,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:30,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:45:30,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:30,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:45:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:45:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:45:30,492 INFO L87 Difference]: Start difference. First operand 1153 states and 1887 transitions. Second operand 5 states. [2018-10-25 01:45:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:33,761 INFO L93 Difference]: Finished difference Result 2716 states and 4601 transitions. [2018-10-25 01:45:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:33,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-10-25 01:45:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:33,780 INFO L225 Difference]: With dead ends: 2716 [2018-10-25 01:45:33,780 INFO L226 Difference]: Without dead ends: 1569 [2018-10-25 01:45:33,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:45:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-25 01:45:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1538. [2018-10-25 01:45:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-10-25 01:45:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2356 transitions. [2018-10-25 01:45:33,843 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2356 transitions. Word has length 141 [2018-10-25 01:45:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:33,844 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 2356 transitions. [2018-10-25 01:45:33,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2356 transitions. [2018-10-25 01:45:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 01:45:33,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:33,851 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] [2018-10-25 01:45:33,851 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:33,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1814928629, now seen corresponding path program 1 times [2018-10-25 01:45:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:33,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:33,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:34,015 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 01:45:34,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:34,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:45:34,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:34,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:45:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:45:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:45:34,017 INFO L87 Difference]: Start difference. First operand 1538 states and 2356 transitions. Second operand 5 states. [2018-10-25 01:45:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:36,422 INFO L93 Difference]: Finished difference Result 4906 states and 7504 transitions. [2018-10-25 01:45:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:45:36,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 01:45:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:36,447 INFO L225 Difference]: With dead ends: 4906 [2018-10-25 01:45:36,447 INFO L226 Difference]: Without dead ends: 3374 [2018-10-25 01:45:36,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:45:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2018-10-25 01:45:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 3263. [2018-10-25 01:45:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3263 states. [2018-10-25 01:45:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 4437 transitions. [2018-10-25 01:45:36,560 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 4437 transitions. Word has length 143 [2018-10-25 01:45:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:36,560 INFO L481 AbstractCegarLoop]: Abstraction has 3263 states and 4437 transitions. [2018-10-25 01:45:36,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 4437 transitions. [2018-10-25 01:45:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-25 01:45:36,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:36,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:45:36,569 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:36,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash -294094552, now seen corresponding path program 1 times [2018-10-25 01:45:36,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:36,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:36,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 01:45:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:45:36,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:36,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:45:36,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:45:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:45:36,841 INFO L87 Difference]: Start difference. First operand 3263 states and 4437 transitions. Second operand 4 states. [2018-10-25 01:45:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:38,830 INFO L93 Difference]: Finished difference Result 8771 states and 12434 transitions. [2018-10-25 01:45:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:45:38,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-10-25 01:45:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:38,866 INFO L225 Difference]: With dead ends: 8771 [2018-10-25 01:45:38,866 INFO L226 Difference]: Without dead ends: 5514 [2018-10-25 01:45:38,892 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 01:45:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2018-10-25 01:45:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 5512. [2018-10-25 01:45:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2018-10-25 01:45:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 7392 transitions. [2018-10-25 01:45:39,052 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 7392 transitions. Word has length 228 [2018-10-25 01:45:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:39,053 INFO L481 AbstractCegarLoop]: Abstraction has 5512 states and 7392 transitions. [2018-10-25 01:45:39,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:45:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 7392 transitions. [2018-10-25 01:45:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-25 01:45:39,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:39,087 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, 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] [2018-10-25 01:45:39,088 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:39,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2115072535, now seen corresponding path program 1 times [2018-10-25 01:45:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:39,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:39,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:39,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:39,665 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-25 01:45:40,002 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-25 01:45:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:45:40,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:45:40,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:45:40,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-10-25 01:45:40,396 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-10-25 01:45:40,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:45:40,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:45:45,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:45:45,015 INFO L272 AbstractInterpreter]: Visited 159 different actions 159 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:45:45,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:45,060 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:45:48,486 INFO L232 lantSequenceWeakener]: Weakened 328 states. On average, predicates are now at 78.02% of their original sizes. [2018-10-25 01:45:48,486 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:45:48,744 INFO L413 sIntCurrentIteration]: We have 336 unified AI predicates [2018-10-25 01:45:48,744 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:45:48,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:45:48,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 01:45:48,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:48,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:48,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:48,747 INFO L87 Difference]: Start difference. First operand 5512 states and 7392 transitions. Second operand 6 states. [2018-10-25 01:46:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:46:24,870 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.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:46:24,875 INFO L168 Benchmark]: Toolchain (without parser) took 66521.95 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 611.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,877 INFO L168 Benchmark]: CDTParser took 0.21 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:46:24,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 232.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,879 INFO L168 Benchmark]: Boogie Preprocessor took 110.30 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,880 INFO L168 Benchmark]: RCFGBuilder took 3934.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.5 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,881 INFO L168 Benchmark]: TraceAbstraction took 61457.05 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 515.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:24,887 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.21 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 780.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 232.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.30 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3934.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.5 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61457.05 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 515.1 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...