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_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:37:52,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:37:52,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:37:52,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:37:52,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:37:52,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:37:52,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:37:52,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:37:52,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:37:52,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:37:52,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:37:52,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:37:52,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:37:52,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:37:52,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:37:52,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:37:52,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:37:52,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:37:52,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:37:52,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:37:52,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:37:52,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:37:52,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:37:52,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:37:52,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:37:52,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:37:52,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:37:52,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:37:52,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:37:52,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:37:52,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:37:52,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:37:52,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:37:52,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:37:52,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:37:52,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:37:52,808 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:37:52,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:37:52,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:37:52,833 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:37:52,834 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:37:52,835 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:37:52,835 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:37:52,835 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:37:52,835 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:37:52,835 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:37:52,836 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:37:52,836 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:37:52,836 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:37:52,836 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:37:52,836 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:37:52,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:37:52,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:37:52,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:37:52,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:37:52,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:37:52,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:37:52,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:37:52,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:37:52,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:37:52,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:37:52,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:37:52,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:37:52,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:37:52,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:37:52,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:37:52,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:37:52,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:37:52,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:37:52,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:37:52,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:37:52,843 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:37:52,844 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:37:52,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:37:52,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:37:52,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:37:52,929 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:37:52,929 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:37:52,930 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label24_true-unreach-call.c [2018-10-25 01:37:52,989 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83df0cd84/fc028b4184034087b6bdf44ca5904655/FLAG4e403b59a [2018-10-25 01:37:53,782 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:37:53,783 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label24_true-unreach-call.c [2018-10-25 01:37:53,813 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83df0cd84/fc028b4184034087b6bdf44ca5904655/FLAG4e403b59a [2018-10-25 01:37:53,829 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83df0cd84/fc028b4184034087b6bdf44ca5904655 [2018-10-25 01:37:53,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:37:53,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:37:53,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:53,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:37:53,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:37:53,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:53" (1/1) ... [2018-10-25 01:37:53,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1086b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:53, skipping insertion in model container [2018-10-25 01:37:53,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:53" (1/1) ... [2018-10-25 01:37:53,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:37:54,025 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:37:55,363 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:55,368 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:37:55,953 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:55,984 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:37:55,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55 WrapperNode [2018-10-25 01:37:55,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:55,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:55,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:37:55,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:37:55,997 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:37:55" (1/1) ... [2018-10-25 01:37:56,058 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:37:55" (1/1) ... [2018-10-25 01:37:56,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:56,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:37:56,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:37:56,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:37:56,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (1/1) ... [2018-10-25 01:37:56,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:37:56,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:37:56,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:37:56,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:37:56,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (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:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:37:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:37:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:37:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:37:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:37:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:37:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:37:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:37:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:37:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:37:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:38:08,840 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:38:08,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:08 BoogieIcfgContainer [2018-10-25 01:38:08,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:38:08,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:38:08,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:38:08,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:38:08,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:37:53" (1/3) ... [2018-10-25 01:38:08,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcced68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:08, skipping insertion in model container [2018-10-25 01:38:08,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:55" (2/3) ... [2018-10-25 01:38:08,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcced68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:08, skipping insertion in model container [2018-10-25 01:38:08,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:08" (3/3) ... [2018-10-25 01:38:08,849 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label24_true-unreach-call.c [2018-10-25 01:38:08,859 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:38:08,868 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:38:08,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:38:09,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:38:09,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:38:09,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:38:09,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:38:09,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:38:09,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:38:09,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:38:09,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:38:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:38:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-25 01:38:09,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:09,150 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] [2018-10-25 01:38:09,155 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:09,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1344002707, now seen corresponding path program 1 times [2018-10-25 01:38:09,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:09,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:09,210 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:09,662 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:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:38:09,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:09,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:38:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:38:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:38:09,692 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:38:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:17,744 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:38:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:38:17,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-25 01:38:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:17,794 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:38:17,794 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:38:17,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:38:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:38:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:38:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:38:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2969 transitions. [2018-10-25 01:38:17,974 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2969 transitions. Word has length 53 [2018-10-25 01:38:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:17,975 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2969 transitions. [2018-10-25 01:38:17,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:38:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2969 transitions. [2018-10-25 01:38:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:38:17,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:17,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,994 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:17,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -450811892, now seen corresponding path program 1 times [2018-10-25 01:38:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:17,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:17,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:18,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:38:18,282 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:18,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:38:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:38:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:38:18,285 INFO L87 Difference]: Start difference. First operand 1604 states and 2969 transitions. Second operand 5 states. [2018-10-25 01:38:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:30,680 INFO L93 Difference]: Finished difference Result 4038 states and 7427 transitions. [2018-10-25 01:38:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:30,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-25 01:38:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:30,707 INFO L225 Difference]: With dead ends: 4038 [2018-10-25 01:38:30,708 INFO L226 Difference]: Without dead ends: 2440 [2018-10-25 01:38:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:38:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2018-10-25 01:38:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2413. [2018-10-25 01:38:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-10-25 01:38:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 4141 transitions. [2018-10-25 01:38:30,815 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 4141 transitions. Word has length 127 [2018-10-25 01:38:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:30,816 INFO L481 AbstractCegarLoop]: Abstraction has 2413 states and 4141 transitions. [2018-10-25 01:38:30,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:38:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 4141 transitions. [2018-10-25 01:38:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 01:38:30,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:30,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,828 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:30,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1515805392, now seen corresponding path program 1 times [2018-10-25 01:38:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:30,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:30,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:31,190 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:31,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:31,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:31,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-10-25 01:38:31,270 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], [2191], [2193], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:31,315 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:31,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:31,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:38:31,976 INFO L272 AbstractInterpreter]: Visited 84 different actions 160 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:38:32,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:32,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:38:32,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:32,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:38:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:32,047 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:38:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:32,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:38:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:32,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:38:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:32,761 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:38:32,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-10-25 01:38:32,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:32,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:38:32,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:38:32,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:32,765 INFO L87 Difference]: Start difference. First operand 2413 states and 4141 transitions. Second operand 3 states. [2018-10-25 01:38:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:39,787 INFO L93 Difference]: Finished difference Result 7156 states and 12477 transitions. [2018-10-25 01:38:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:38:39,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-10-25 01:38:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:39,823 INFO L225 Difference]: With dead ends: 7156 [2018-10-25 01:38:39,823 INFO L226 Difference]: Without dead ends: 4749 [2018-10-25 01:38:39,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2018-10-25 01:38:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4749. [2018-10-25 01:38:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4749 states. [2018-10-25 01:38:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 7195 transitions. [2018-10-25 01:38:39,979 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 7195 transitions. Word has length 129 [2018-10-25 01:38:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:39,982 INFO L481 AbstractCegarLoop]: Abstraction has 4749 states and 7195 transitions. [2018-10-25 01:38:39,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:38:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 7195 transitions. [2018-10-25 01:38:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:38:39,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:39,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,986 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:39,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash 56708252, now seen corresponding path program 1 times [2018-10-25 01:38:39,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:39,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:40,264 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:40,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:40,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:40,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:40,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:40,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:40,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:40,305 INFO L87 Difference]: Start difference. First operand 4749 states and 7195 transitions. Second operand 6 states. [2018-10-25 01:38:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:51,127 INFO L93 Difference]: Finished difference Result 17482 states and 27226 transitions. [2018-10-25 01:38:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:51,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-25 01:38:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:51,194 INFO L225 Difference]: With dead ends: 17482 [2018-10-25 01:38:51,194 INFO L226 Difference]: Without dead ends: 12739 [2018-10-25 01:38:51,225 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:38:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2018-10-25 01:38:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12652. [2018-10-25 01:38:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12652 states. [2018-10-25 01:38:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12652 states to 12652 states and 18756 transitions. [2018-10-25 01:38:51,551 INFO L78 Accepts]: Start accepts. Automaton has 12652 states and 18756 transitions. Word has length 135 [2018-10-25 01:38:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:51,552 INFO L481 AbstractCegarLoop]: Abstraction has 12652 states and 18756 transitions. [2018-10-25 01:38:51,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12652 states and 18756 transitions. [2018-10-25 01:38:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 01:38:51,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:51,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,558 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:51,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2138160203, now seen corresponding path program 1 times [2018-10-25 01:38:51,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:51,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:51,861 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:52,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:52,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:52,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:52,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:52,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:52,223 INFO L87 Difference]: Start difference. First operand 12652 states and 18756 transitions. Second operand 6 states. [2018-10-25 01:38:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:59,071 INFO L93 Difference]: Finished difference Result 28666 states and 43319 transitions. [2018-10-25 01:38:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:59,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 01:38:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:59,161 INFO L225 Difference]: With dead ends: 28666 [2018-10-25 01:38:59,161 INFO L226 Difference]: Without dead ends: 16020 [2018-10-25 01:38:59,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16020 states. [2018-10-25 01:38:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16020 to 15974. [2018-10-25 01:38:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15974 states. [2018-10-25 01:38:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15974 states to 15974 states and 22998 transitions. [2018-10-25 01:38:59,581 INFO L78 Accepts]: Start accepts. Automaton has 15974 states and 22998 transitions. Word has length 156 [2018-10-25 01:38:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:59,582 INFO L481 AbstractCegarLoop]: Abstraction has 15974 states and 22998 transitions. [2018-10-25 01:38:59,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15974 states and 22998 transitions. [2018-10-25 01:38:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-25 01:38:59,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:59,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,593 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:59,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 802704968, now seen corresponding path program 1 times [2018-10-25 01:38:59,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:59,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:59,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:59,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:59,895 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:00,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:00,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:39:00,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:00,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:00,295 INFO L87 Difference]: Start difference. First operand 15974 states and 22998 transitions. Second operand 6 states. [2018-10-25 01:39:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:12,145 INFO L93 Difference]: Finished difference Result 33966 states and 49476 transitions. [2018-10-25 01:39:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:39:12,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-10-25 01:39:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:12,207 INFO L225 Difference]: With dead ends: 33966 [2018-10-25 01:39:12,208 INFO L226 Difference]: Without dead ends: 17998 [2018-10-25 01:39:12,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:39:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17998 states. [2018-10-25 01:39:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17998 to 17845. [2018-10-25 01:39:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17845 states. [2018-10-25 01:39:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17845 states to 17845 states and 24000 transitions. [2018-10-25 01:39:12,589 INFO L78 Accepts]: Start accepts. Automaton has 17845 states and 24000 transitions. Word has length 173 [2018-10-25 01:39:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:12,590 INFO L481 AbstractCegarLoop]: Abstraction has 17845 states and 24000 transitions. [2018-10-25 01:39:12,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:39:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17845 states and 24000 transitions. [2018-10-25 01:39:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 01:39:12,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:12,598 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, 2, 2, 2, 2, 2, 2, 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:12,599 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:12,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -349036039, now seen corresponding path program 1 times [2018-10-25 01:39:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:12,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:12,896 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 93 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 01:39:13,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:13,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:39:13,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-25 01:39:13,757 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], [2191], [2193], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2408], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:39:13,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:39:13,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:39:18,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:39:18,989 INFO L272 AbstractInterpreter]: Visited 91 different actions 174 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:39:18,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:18,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:39:18,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:18,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:39:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:19,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:39:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:19,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:39:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-25 01:39:19,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:39:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-25 01:39:19,649 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:39:19,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 14 [2018-10-25 01:39:19,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:19,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:39:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:39:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:39:19,651 INFO L87 Difference]: Start difference. First operand 17845 states and 24000 transitions. Second operand 5 states. [2018-10-25 01:39:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:27,921 INFO L93 Difference]: Finished difference Result 53559 states and 74825 transitions. [2018-10-25 01:39:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:27,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2018-10-25 01:39:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:28,040 INFO L225 Difference]: With dead ends: 53559 [2018-10-25 01:39:28,041 INFO L226 Difference]: Without dead ends: 35720 [2018-10-25 01:39:28,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 416 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-25 01:39:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35720 states. [2018-10-25 01:39:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35720 to 35512. [2018-10-25 01:39:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35512 states. [2018-10-25 01:39:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35512 states to 35512 states and 45928 transitions. [2018-10-25 01:39:28,750 INFO L78 Accepts]: Start accepts. Automaton has 35512 states and 45928 transitions. Word has length 211 [2018-10-25 01:39:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:28,752 INFO L481 AbstractCegarLoop]: Abstraction has 35512 states and 45928 transitions. [2018-10-25 01:39:28,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:39:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 35512 states and 45928 transitions. [2018-10-25 01:39:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-25 01:39:28,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:28,766 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:39:28,767 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:28,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1582239141, now seen corresponding path program 1 times [2018-10-25 01:39:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:28,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:39:29,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:29,038 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:39:29,038 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-10-25 01:39:29,039 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], [2191], [2193], [2196], [2204], [2212], [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], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2568], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:39:29,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:39:29,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:39:29,319 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:39:29,319 INFO L272 AbstractInterpreter]: Visited 127 different actions 127 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:39:29,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:29,346 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:39:29,888 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 75.57% of their original sizes. [2018-10-25 01:39:29,889 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:39:29,985 INFO L413 sIntCurrentIteration]: We have 248 unified AI predicates [2018-10-25 01:39:29,985 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:39:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:39:29,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:39:29,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:29,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:29,988 INFO L87 Difference]: Start difference. First operand 35512 states and 45928 transitions. Second operand 6 states. [2018-10-25 01:39:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:54,420 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: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:39:54,425 INFO L168 Benchmark]: Toolchain (without parser) took 120584.18 ms. Allocated memory was 1.6 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -113.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:39:54,427 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:39:54,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2142.14 ms. Allocated memory is still 1.6 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:54,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 555.94 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 807.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.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:54,429 INFO L168 Benchmark]: Boogie Preprocessor took 257.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:54,430 INFO L168 Benchmark]: RCFGBuilder took 12040.59 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 651.4 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:54,431 INFO L168 Benchmark]: TraceAbstraction took 105582.68 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 45.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-25 01:39:54,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2142.14 ms. Allocated memory is still 1.6 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 555.94 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 807.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.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 257.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12040.59 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 651.4 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105582.68 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 45.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...