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/Problem16_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:52:26,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:52:26,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:52:26,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:52:26,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:52:26,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:52:26,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:52:26,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:52:26,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:52:26,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:52:26,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:52:26,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:52:26,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:52:26,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:52:26,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:52:26,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:52:26,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:52:26,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:52:26,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:52:26,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:52:26,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:52:26,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:52:26,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:52:26,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:52:26,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:52:26,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:52:26,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:52:26,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:52:26,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:52:26,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:52:26,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:52:26,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:52:26,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:52:26,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:52:26,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:52:26,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:52:26,522 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:52:26,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:52:26,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:52:26,552 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:52:26,552 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:52:26,552 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:52:26,552 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:52:26,553 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:52:26,553 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:52:26,553 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:52:26,553 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:52:26,553 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:52:26,554 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:52:26,554 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:52:26,554 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:52:26,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:52:26,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:52:26,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:52:26,557 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:52:26,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:52:26,558 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:52:26,558 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:52:26,558 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:52:26,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:52:26,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:52:26,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:52:26,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:52:26,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:52:26,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:52:26,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:52:26,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:52:26,561 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:52:26,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:52:26,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:52:26,561 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:52:26,562 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:52:26,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:52:26,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:52:26,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:52:26,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:52:26,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:52:26,628 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:52:26,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label17_true-unreach-call.c [2018-10-25 01:52:26,694 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2dfd4195/cf84463c0c3a46dcbb3c2a4ab3b5eba5/FLAGb17736d46 [2018-10-25 01:52:27,353 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:52:27,355 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label17_true-unreach-call.c [2018-10-25 01:52:27,374 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2dfd4195/cf84463c0c3a46dcbb3c2a4ab3b5eba5/FLAGb17736d46 [2018-10-25 01:52:27,396 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2dfd4195/cf84463c0c3a46dcbb3c2a4ab3b5eba5 [2018-10-25 01:52:27,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:52:27,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:52:27,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:27,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:52:27,415 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:52:27,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:27" (1/1) ... [2018-10-25 01:52:27,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231879ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:27, skipping insertion in model container [2018-10-25 01:52:27,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:27" (1/1) ... [2018-10-25 01:52:27,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:52:27,534 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:52:28,347 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:28,352 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:52:28,597 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:28,619 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:52:28,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28 WrapperNode [2018-10-25 01:52:28,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:28,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:28,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:52:28,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:52:28,633 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:52:28" (1/1) ... [2018-10-25 01:52:28,689 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:52:28" (1/1) ... [2018-10-25 01:52:28,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:28,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:52:28,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:52:28,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:52:28,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:28,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:28,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:28,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:29,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:29,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:29,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (1/1) ... [2018-10-25 01:52:29,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:52:29,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:52:29,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:52:29,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:52:29,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (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:52:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:52:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:52:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:52:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:52:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:52:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:52:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:52:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:52:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:52:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:52:34,749 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:52:34,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:34 BoogieIcfgContainer [2018-10-25 01:52:34,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:52:34,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:52:34,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:52:34,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:52:34,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:52:27" (1/3) ... [2018-10-25 01:52:34,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc93783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:34, skipping insertion in model container [2018-10-25 01:52:34,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:28" (2/3) ... [2018-10-25 01:52:34,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc93783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:34, skipping insertion in model container [2018-10-25 01:52:34,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:34" (3/3) ... [2018-10-25 01:52:34,760 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label17_true-unreach-call.c [2018-10-25 01:52:34,770 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:52:34,778 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:52:34,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:52:34,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:52:34,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:52:34,839 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:52:34,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:52:34,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:52:34,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:52:34,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:52:34,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:52:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:52:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-25 01:52:34,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:34,892 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] [2018-10-25 01:52:34,895 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:34,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1724248043, now seen corresponding path program 1 times [2018-10-25 01:52:34,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:34,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:34,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:34,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:35,428 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:35,529 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:52:35,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:35,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:52:35,533 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:35,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:52:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:52:35,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:52:35,562 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-10-25 01:52:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:39,064 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-10-25 01:52:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:52:39,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-25 01:52:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:39,089 INFO L225 Difference]: With dead ends: 1156 [2018-10-25 01:52:39,090 INFO L226 Difference]: Without dead ends: 744 [2018-10-25 01:52:39,099 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:52:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-25 01:52:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-10-25 01:52:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:52:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1355 transitions. [2018-10-25 01:52:39,227 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1355 transitions. Word has length 65 [2018-10-25 01:52:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:39,228 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1355 transitions. [2018-10-25 01:52:39,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:52:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1355 transitions. [2018-10-25 01:52:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:52:39,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:39,238 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, 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:52:39,239 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:39,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:39,239 INFO L82 PathProgramCache]: Analyzing trace with hash 735694757, now seen corresponding path program 1 times [2018-10-25 01:52:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:39,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:39,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:39,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:39,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:39,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:39,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:39,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:39,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:39,536 INFO L87 Difference]: Start difference. First operand 744 states and 1355 transitions. Second operand 6 states. [2018-10-25 01:52:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:46,486 INFO L93 Difference]: Finished difference Result 2191 states and 4077 transitions. [2018-10-25 01:52:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:46,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:52:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:46,500 INFO L225 Difference]: With dead ends: 2191 [2018-10-25 01:52:46,501 INFO L226 Difference]: Without dead ends: 1453 [2018-10-25 01:52:46,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2018-10-25 01:52:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1436. [2018-10-25 01:52:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-10-25 01:52:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2556 transitions. [2018-10-25 01:52:46,567 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2556 transitions. Word has length 136 [2018-10-25 01:52:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:46,568 INFO L481 AbstractCegarLoop]: Abstraction has 1436 states and 2556 transitions. [2018-10-25 01:52:46,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2556 transitions. [2018-10-25 01:52:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:52:46,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:46,573 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, 1, 1, 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:52:46,573 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:46,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1598709869, now seen corresponding path program 1 times [2018-10-25 01:52:46,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:46,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:46,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:46,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:46,961 INFO L87 Difference]: Start difference. First operand 1436 states and 2556 transitions. Second operand 6 states. [2018-10-25 01:52:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:52,616 INFO L93 Difference]: Finished difference Result 3925 states and 7037 transitions. [2018-10-25 01:52:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:52,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-25 01:52:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:52,632 INFO L225 Difference]: With dead ends: 3925 [2018-10-25 01:52:52,633 INFO L226 Difference]: Without dead ends: 2495 [2018-10-25 01:52:52,641 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:52:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-10-25 01:52:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2466. [2018-10-25 01:52:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2466 states. [2018-10-25 01:52:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4043 transitions. [2018-10-25 01:52:52,724 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4043 transitions. Word has length 140 [2018-10-25 01:52:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:52,725 INFO L481 AbstractCegarLoop]: Abstraction has 2466 states and 4043 transitions. [2018-10-25 01:52:52,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4043 transitions. [2018-10-25 01:52:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-25 01:52:52,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:52,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:52,730 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:52,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash -901457180, now seen corresponding path program 1 times [2018-10-25 01:52:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:52,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:52,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:52,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:52,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:52,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:52,992 INFO L87 Difference]: Start difference. First operand 2466 states and 4043 transitions. Second operand 6 states. [2018-10-25 01:52:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:57,622 INFO L93 Difference]: Finished difference Result 6987 states and 11546 transitions. [2018-10-25 01:52:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:57,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2018-10-25 01:52:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:57,648 INFO L225 Difference]: With dead ends: 6987 [2018-10-25 01:52:57,648 INFO L226 Difference]: Without dead ends: 4527 [2018-10-25 01:52:57,666 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:52:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2018-10-25 01:52:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4495. [2018-10-25 01:52:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4495 states. [2018-10-25 01:52:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 4495 states and 6547 transitions. [2018-10-25 01:52:57,802 INFO L78 Accepts]: Start accepts. Automaton has 4495 states and 6547 transitions. Word has length 171 [2018-10-25 01:52:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:57,803 INFO L481 AbstractCegarLoop]: Abstraction has 4495 states and 6547 transitions. [2018-10-25 01:52:57,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4495 states and 6547 transitions. [2018-10-25 01:52:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-25 01:52:57,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:57,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,811 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:57,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1025094140, now seen corresponding path program 1 times [2018-10-25 01:52:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:57,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:57,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:58,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:58,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:58,467 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:58,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:58,469 INFO L87 Difference]: Start difference. First operand 4495 states and 6547 transitions. Second operand 6 states. [2018-10-25 01:53:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:07,431 INFO L93 Difference]: Finished difference Result 17032 states and 26184 transitions. [2018-10-25 01:53:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:07,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2018-10-25 01:53:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:07,511 INFO L225 Difference]: With dead ends: 17032 [2018-10-25 01:53:07,511 INFO L226 Difference]: Without dead ends: 12543 [2018-10-25 01:53:07,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:53:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12543 states. [2018-10-25 01:53:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12543 to 12538. [2018-10-25 01:53:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12538 states. [2018-10-25 01:53:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12538 states to 12538 states and 17866 transitions. [2018-10-25 01:53:07,926 INFO L78 Accepts]: Start accepts. Automaton has 12538 states and 17866 transitions. Word has length 215 [2018-10-25 01:53:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:07,926 INFO L481 AbstractCegarLoop]: Abstraction has 12538 states and 17866 transitions. [2018-10-25 01:53:07,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12538 states and 17866 transitions. [2018-10-25 01:53:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-25 01:53:07,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:07,974 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:53:07,974 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:07,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1811832691, now seen corresponding path program 1 times [2018-10-25 01:53:07,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:07,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:07,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:07,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:07,976 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:08,316 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 116 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:53:08,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:53:08,655 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:53:08,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-10-25 01:53:08,658 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [599], [601], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [692], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1188], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:53:08,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:53:08,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:53:09,396 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:53:09,398 INFO L272 AbstractInterpreter]: Visited 204 different actions 204 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:53:09,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:09,440 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:53:10,303 INFO L232 lantSequenceWeakener]: Weakened 330 states. On average, predicates are now at 77.94% of their original sizes. [2018-10-25 01:53:10,304 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:53:10,577 INFO L413 sIntCurrentIteration]: We have 338 unified AI predicates [2018-10-25 01:53:10,578 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:53:10,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:53:10,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:53:10,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:10,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:10,580 INFO L87 Difference]: Start difference. First operand 12538 states and 17866 transitions. Second operand 6 states. [2018-10-25 01:55:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:55:28,821 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.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:55:28,826 INFO L168 Benchmark]: Toolchain (without parser) took 181417.45 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 814.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,827 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:55:28,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1209.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 342.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,830 INFO L168 Benchmark]: Boogie Preprocessor took 160.77 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,831 INFO L168 Benchmark]: RCFGBuilder took 5625.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.8 MB). Peak memory consumption was 260.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,832 INFO L168 Benchmark]: TraceAbstraction took 174073.84 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 566.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:28,838 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 1209.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 342.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.77 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: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5625.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.8 MB). Peak memory consumption was 260.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174073.84 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 566.8 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...