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/Problem12_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:38:41,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:38:41,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:38:41,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:38:41,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:38:41,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:38:41,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:38:41,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:38:41,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:38:41,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:38:41,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:38:41,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:38:41,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:38:41,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:38:41,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:38:41,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:38:41,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:38:41,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:38:41,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:38:41,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:38:41,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:38:41,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:38:41,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:38:41,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:38:41,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:38:41,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:38:41,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:38:41,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:38:41,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:38:41,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:38:41,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:38:41,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:38:41,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:38:41,589 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:38:41,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:38:41,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:38:41,592 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:38:41,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:38:41,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:38:41,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:38:41,627 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:38:41,627 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:38:41,627 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:38:41,628 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:38:41,629 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:38:41,629 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:38:41,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:38:41,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:38:41,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:38:41,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:38:41,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:38:41,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:38:41,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:38:41,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:38:41,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:38:41,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:38:41,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:38:41,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:38:41,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:38:41,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:38:41,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:38:41,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:38:41,635 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:38:41,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:38:41,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:38:41,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:38:41,636 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:38:41,636 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:38:41,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:38:41,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:38:41,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:38:41,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:38:41,738 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:38:41,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label33_true-unreach-call.c [2018-10-25 01:38:41,806 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbefc43b/c045b7f179ad4b4e8e0db31d3a03cf83/FLAG42cd9ea66 [2018-10-25 01:38:42,567 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:38:42,568 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label33_true-unreach-call.c [2018-10-25 01:38:42,596 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbefc43b/c045b7f179ad4b4e8e0db31d3a03cf83/FLAG42cd9ea66 [2018-10-25 01:38:42,616 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbefc43b/c045b7f179ad4b4e8e0db31d3a03cf83 [2018-10-25 01:38:42,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:38:42,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:38:42,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:42,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:38:42,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:38:42,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:42" (1/1) ... [2018-10-25 01:38:42,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fe24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:42, skipping insertion in model container [2018-10-25 01:38:42,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:42" (1/1) ... [2018-10-25 01:38:42,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:38:42,810 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:38:44,223 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:44,232 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:38:44,853 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:44,887 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:38:44,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44 WrapperNode [2018-10-25 01:38:44,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:44,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:44,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:38:44,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:38:44,900 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:38:44" (1/1) ... [2018-10-25 01:38:44,970 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:38:44" (1/1) ... [2018-10-25 01:38:45,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:45,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:38:45,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:38:45,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:38:45,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (1/1) ... [2018-10-25 01:38:45,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:38:45,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:38:45,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:38:45,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:38:45,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (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:38:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:38:45,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:38:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:38:45,686 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:38:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:38:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:38:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:38:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:38:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:38:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:38:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:38:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:38:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:38:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:38:57,656 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:38:57,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:57 BoogieIcfgContainer [2018-10-25 01:38:57,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:38:57,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:38:57,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:38:57,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:38:57,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:38:42" (1/3) ... [2018-10-25 01:38:57,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1beff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:57, skipping insertion in model container [2018-10-25 01:38:57,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:44" (2/3) ... [2018-10-25 01:38:57,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1beff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:57, skipping insertion in model container [2018-10-25 01:38:57,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:57" (3/3) ... [2018-10-25 01:38:57,665 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label33_true-unreach-call.c [2018-10-25 01:38:57,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:38:57,685 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:38:57,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:38:57,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:38:57,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:38:57,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:38:57,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:38:57,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:38:57,759 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:38:57,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:38:57,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:38:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:38:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 01:38:57,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:57,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:38:57,836 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:57,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1505698572, now seen corresponding path program 1 times [2018-10-25 01:38:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:57,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:58,421 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:38:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:58,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:38:58,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:58,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:38:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:38:58,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:38:58,451 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-25 01:39:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:13,382 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-25 01:39:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:39:13,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-10-25 01:39:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:13,428 INFO L225 Difference]: With dead ends: 3234 [2018-10-25 01:39:13,429 INFO L226 Difference]: Without dead ends: 2388 [2018-10-25 01:39:13,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:39:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-25 01:39:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-10-25 01:39:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-10-25 01:39:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4022 transitions. [2018-10-25 01:39:13,626 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4022 transitions. Word has length 56 [2018-10-25 01:39:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:13,627 INFO L481 AbstractCegarLoop]: Abstraction has 2388 states and 4022 transitions. [2018-10-25 01:39:13,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:39:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4022 transitions. [2018-10-25 01:39:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 01:39:13,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:13,649 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:39:13,649 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:13,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1233616770, now seen corresponding path program 1 times [2018-10-25 01:39:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:13,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:39:14,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:14,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:14,012 INFO L87 Difference]: Start difference. First operand 2388 states and 4022 transitions. Second operand 6 states. [2018-10-25 01:39:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:29,455 INFO L93 Difference]: Finished difference Result 9453 states and 16261 transitions. [2018-10-25 01:39:29,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:39:29,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 01:39:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:29,511 INFO L225 Difference]: With dead ends: 9453 [2018-10-25 01:39:29,511 INFO L226 Difference]: Without dead ends: 7071 [2018-10-25 01:39:29,525 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:39:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2018-10-25 01:39:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7023. [2018-10-25 01:39:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2018-10-25 01:39:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 10536 transitions. [2018-10-25 01:39:29,758 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 10536 transitions. Word has length 156 [2018-10-25 01:39:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:29,759 INFO L481 AbstractCegarLoop]: Abstraction has 7023 states and 10536 transitions. [2018-10-25 01:39:29,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:39:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 10536 transitions. [2018-10-25 01:39:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 01:39:29,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:29,773 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:39:29,774 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:29,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1668109382, now seen corresponding path program 1 times [2018-10-25 01:39:29,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:29,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:30,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:30,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:39:30,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:30,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:39:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:39:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:39:30,180 INFO L87 Difference]: Start difference. First operand 7023 states and 10536 transitions. Second operand 4 states. [2018-10-25 01:39:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:39,407 INFO L93 Difference]: Finished difference Result 27807 states and 43305 transitions. [2018-10-25 01:39:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:39:39,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-25 01:39:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:39,527 INFO L225 Difference]: With dead ends: 27807 [2018-10-25 01:39:39,527 INFO L226 Difference]: Without dead ends: 20790 [2018-10-25 01:39:39,568 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:39:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20790 states. [2018-10-25 01:39:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20790 to 20790. [2018-10-25 01:39:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20790 states. [2018-10-25 01:39:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 31085 transitions. [2018-10-25 01:39:40,098 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 31085 transitions. Word has length 206 [2018-10-25 01:39:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:40,098 INFO L481 AbstractCegarLoop]: Abstraction has 20790 states and 31085 transitions. [2018-10-25 01:39:40,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:39:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 31085 transitions. [2018-10-25 01:39:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-25 01:39:40,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:40,111 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:39:40,112 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:40,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1323393900, now seen corresponding path program 1 times [2018-10-25 01:39:40,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:40,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:40,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:40,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 98 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:39:40,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:40,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:39:40,526 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-10-25 01:39:40,530 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2215], [2217], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2376], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:39:40,587 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:39:40,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:39:41,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:39:41,110 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:39:41,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:41,127 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:39:41,939 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 75.75% of their original sizes. [2018-10-25 01:39:41,940 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:39:42,129 INFO L413 sIntCurrentIteration]: We have 209 unified AI predicates [2018-10-25 01:39:42,129 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:39:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:39:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:39:42,130 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:42,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:42,132 INFO L87 Difference]: Start difference. First operand 20790 states and 31085 transitions. Second operand 6 states. [2018-10-25 01:39:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:43,955 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.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:39:43,961 INFO L168 Benchmark]: Toolchain (without parser) took 61330.02 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 126.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,963 INFO L168 Benchmark]: CDTParser took 0.19 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:39:43,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2253.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 472.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,965 INFO L168 Benchmark]: Boogie Preprocessor took 250.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,966 INFO L168 Benchmark]: RCFGBuilder took 12043.06 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 165.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -148.9 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,967 INFO L168 Benchmark]: TraceAbstraction took 46302.36 ms. Allocated memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: 325.6 MB). Free memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: -212.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:43,973 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.19 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 2253.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 472.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 250.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12043.06 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 165.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -148.9 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46302.36 ms. Allocated memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: 325.6 MB). Free memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: -212.3 MB). Peak memory consumption was 113.3 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...