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_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:40:19,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:40:19,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:40:19,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:40:19,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:40:19,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:40:19,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:40:19,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:40:19,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:40:19,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:40:19,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:40:19,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:40:19,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:40:19,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:40:19,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:40:19,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:40:19,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:40:19,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:40:19,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:40:19,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:40:19,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:40:19,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:40:19,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:40:19,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:40:19,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:40:19,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:40:19,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:40:19,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:40:19,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:40:19,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:40:19,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:40:19,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:40:19,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:40:19,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:40:19,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:40:19,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:40:19,783 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:40:19,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:40:19,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:40:19,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:40:19,802 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:40:19,802 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:40:19,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:40:19,802 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:40:19,803 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:40:19,803 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:40:19,803 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:40:19,803 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:40:19,803 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:40:19,804 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:40:19,804 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:40:19,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:40:19,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:40:19,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:40:19,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:40:19,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:40:19,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:40:19,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:40:19,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:40:19,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:40:19,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:40:19,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:40:19,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:40:19,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:40:19,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:40:19,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:40:19,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:40:19,808 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:40:19,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:40:19,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:40:19,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:40:19,808 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:40:19,809 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:40:19,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:40:19,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:40:19,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:40:19,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:40:19,881 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:40:19,882 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label59_true-unreach-call.c [2018-10-25 01:40:19,948 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d544702/fa60a253faf6496e8e4351c808c2cbf7/FLAG5b68f38ec [2018-10-25 01:40:20,786 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:40:20,787 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label59_true-unreach-call.c [2018-10-25 01:40:20,816 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d544702/fa60a253faf6496e8e4351c808c2cbf7/FLAG5b68f38ec [2018-10-25 01:40:20,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d544702/fa60a253faf6496e8e4351c808c2cbf7 [2018-10-25 01:40:20,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:40:20,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:40:20,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:20,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:40:20,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:40:20,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:20" (1/1) ... [2018-10-25 01:40:20,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed858fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:20, skipping insertion in model container [2018-10-25 01:40:20,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:40:20" (1/1) ... [2018-10-25 01:40:20,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:40:21,023 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:40:22,298 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:22,303 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:40:22,927 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:40:22,961 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:40:22,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22 WrapperNode [2018-10-25 01:40:22,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:40:22,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:22,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:40:22,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:40:22,975 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:40:22" (1/1) ... [2018-10-25 01:40:23,046 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:40:22" (1/1) ... [2018-10-25 01:40:23,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:40:23,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:40:23,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:40:23,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:40:23,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (1/1) ... [2018-10-25 01:40:23,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:40:23,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:40:23,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:40:23,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:40:23,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (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:40:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:40:23,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:40:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:40:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:40:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:40:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:40:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:40:23,837 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:40:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:40:23,837 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:40:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:40:23,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:40:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:40:23,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:40:37,269 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:40:37,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:37 BoogieIcfgContainer [2018-10-25 01:40:37,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:40:37,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:40:37,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:40:37,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:40:37,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:40:20" (1/3) ... [2018-10-25 01:40:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59439101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:37, skipping insertion in model container [2018-10-25 01:40:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:40:22" (2/3) ... [2018-10-25 01:40:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59439101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:37, skipping insertion in model container [2018-10-25 01:40:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:37" (3/3) ... [2018-10-25 01:40:37,278 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label59_true-unreach-call.c [2018-10-25 01:40:37,288 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:40:37,298 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:40:37,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:40:37,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:40:37,377 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:40:37,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:40:37,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:40:37,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:40:37,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:40:37,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:40:37,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:40:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:40:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-25 01:40:37,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:37,427 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] [2018-10-25 01:40:37,429 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:37,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash -320389013, now seen corresponding path program 1 times [2018-10-25 01:40:37,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:37,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:37,951 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:38,059 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:40:38,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:38,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:40:38,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:38,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:40:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:40:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:40:38,093 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:40:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:46,463 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:40:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:40:46,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-25 01:40:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:46,507 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:40:46,507 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:40:46,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:40:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:40:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:40:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:40:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3014 transitions. [2018-10-25 01:40:46,715 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3014 transitions. Word has length 51 [2018-10-25 01:40:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:46,716 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 3014 transitions. [2018-10-25 01:40:46,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:40:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3014 transitions. [2018-10-25 01:40:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:40:46,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:46,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:46,726 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:46,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash -66311172, now seen corresponding path program 1 times [2018-10-25 01:40:46,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:46,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:46,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:47,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:47,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:40:47,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:47,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:40:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:40:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:40:47,172 INFO L87 Difference]: Start difference. First operand 1604 states and 3014 transitions. Second operand 5 states. [2018-10-25 01:40:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:59,549 INFO L93 Difference]: Finished difference Result 4873 states and 9168 transitions. [2018-10-25 01:40:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:40:59,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 01:40:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:59,574 INFO L225 Difference]: With dead ends: 4873 [2018-10-25 01:40:59,575 INFO L226 Difference]: Without dead ends: 3275 [2018-10-25 01:40:59,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-25 01:40:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-25 01:40:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-25 01:40:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5443 transitions. [2018-10-25 01:40:59,696 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5443 transitions. Word has length 121 [2018-10-25 01:40:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:59,697 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 5443 transitions. [2018-10-25 01:40:59,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:40:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5443 transitions. [2018-10-25 01:40:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:40:59,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:59,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,702 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:59,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1119739496, now seen corresponding path program 1 times [2018-10-25 01:40:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:59,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:59,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:40:59,999 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:41:00,000 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-10-25 01:41:00,003 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], [2175], [2177], [2180], [2188], [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:41:00,054 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:41:00,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:41:00,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:41:00,820 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:41:00,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:00,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:41:00,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:41:00,868 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:41:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:00,884 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:41:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:00,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:41:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:01,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:41:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:01,604 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:41:01,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-10-25 01:41:01,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:01,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:41:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:41:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:01,609 INFO L87 Difference]: Start difference. First operand 3241 states and 5443 transitions. Second operand 3 states. [2018-10-25 01:41:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:08,927 INFO L93 Difference]: Finished difference Result 9583 states and 16414 transitions. [2018-10-25 01:41:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:41:08,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-10-25 01:41:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:08,971 INFO L225 Difference]: With dead ends: 9583 [2018-10-25 01:41:08,972 INFO L226 Difference]: Without dead ends: 6348 [2018-10-25 01:41:08,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-10-25 01:41:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 6348. [2018-10-25 01:41:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6348 states. [2018-10-25 01:41:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6348 states to 6348 states and 9511 transitions. [2018-10-25 01:41:09,195 INFO L78 Accepts]: Start accepts. Automaton has 6348 states and 9511 transitions. Word has length 127 [2018-10-25 01:41:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:09,195 INFO L481 AbstractCegarLoop]: Abstraction has 6348 states and 9511 transitions. [2018-10-25 01:41:09,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:41:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6348 states and 9511 transitions. [2018-10-25 01:41:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:41:09,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:09,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:09,200 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:09,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1996073879, now seen corresponding path program 1 times [2018-10-25 01:41:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:09,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:09,465 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:09,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:09,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:09,770 INFO L87 Difference]: Start difference. First operand 6348 states and 9511 transitions. Second operand 6 states. [2018-10-25 01:41:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:19,036 INFO L93 Difference]: Finished difference Result 15974 states and 23458 transitions. [2018-10-25 01:41:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:19,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:41:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:19,083 INFO L225 Difference]: With dead ends: 15974 [2018-10-25 01:41:19,084 INFO L226 Difference]: Without dead ends: 9632 [2018-10-25 01:41:19,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2018-10-25 01:41:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 9612. [2018-10-25 01:41:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9612 states. [2018-10-25 01:41:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9612 states to 9612 states and 13075 transitions. [2018-10-25 01:41:19,333 INFO L78 Accepts]: Start accepts. Automaton has 9612 states and 13075 transitions. Word has length 136 [2018-10-25 01:41:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:19,333 INFO L481 AbstractCegarLoop]: Abstraction has 9612 states and 13075 transitions. [2018-10-25 01:41:19,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9612 states and 13075 transitions. [2018-10-25 01:41:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-25 01:41:19,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:19,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:19,337 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:19,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash 977865397, now seen corresponding path program 1 times [2018-10-25 01:41:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:19,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:19,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:19,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:19,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:19,568 INFO L87 Difference]: Start difference. First operand 9612 states and 13075 transitions. Second operand 6 states. [2018-10-25 01:41:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:31,322 INFO L93 Difference]: Finished difference Result 26233 states and 36750 transitions. [2018-10-25 01:41:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:31,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-10-25 01:41:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:31,397 INFO L225 Difference]: With dead ends: 26233 [2018-10-25 01:41:31,397 INFO L226 Difference]: Without dead ends: 16627 [2018-10-25 01:41:31,432 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:41:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16627 states. [2018-10-25 01:41:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16627 to 16383. [2018-10-25 01:41:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16383 states. [2018-10-25 01:41:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16383 states to 16383 states and 21980 transitions. [2018-10-25 01:41:31,929 INFO L78 Accepts]: Start accepts. Automaton has 16383 states and 21980 transitions. Word has length 158 [2018-10-25 01:41:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:31,930 INFO L481 AbstractCegarLoop]: Abstraction has 16383 states and 21980 transitions. [2018-10-25 01:41:31,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 16383 states and 21980 transitions. [2018-10-25 01:41:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 01:41:31,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:31,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:31,935 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:31,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1902407537, now seen corresponding path program 1 times [2018-10-25 01:41:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:31,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:31,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:32,208 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:32,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:32,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:32,474 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:32,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:32,475 INFO L87 Difference]: Start difference. First operand 16383 states and 21980 transitions. Second operand 6 states. [2018-10-25 01:41:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:42,770 INFO L93 Difference]: Finished difference Result 43183 states and 61955 transitions. [2018-10-25 01:41:42,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:42,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-25 01:41:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:42,881 INFO L225 Difference]: With dead ends: 43183 [2018-10-25 01:41:42,881 INFO L226 Difference]: Without dead ends: 26806 [2018-10-25 01:41:42,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26806 states. [2018-10-25 01:41:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26806 to 26486. [2018-10-25 01:41:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26486 states. [2018-10-25 01:41:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26486 states to 26486 states and 35504 transitions. [2018-10-25 01:41:43,506 INFO L78 Accepts]: Start accepts. Automaton has 26486 states and 35504 transitions. Word has length 172 [2018-10-25 01:41:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:43,507 INFO L481 AbstractCegarLoop]: Abstraction has 26486 states and 35504 transitions. [2018-10-25 01:41:43,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26486 states and 35504 transitions. [2018-10-25 01:41:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 01:41:43,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:43,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:43,513 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:43,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1379065187, now seen corresponding path program 1 times [2018-10-25 01:41:43,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:43,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:43,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:44,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:44,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:44,100 INFO L87 Difference]: Start difference. First operand 26486 states and 35504 transitions. Second operand 6 states. [2018-10-25 01:42:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:03,725 INFO L93 Difference]: Finished difference Result 103980 states and 154114 transitions. [2018-10-25 01:42:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:03,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 01:42:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:04,038 INFO L225 Difference]: With dead ends: 103980 [2018-10-25 01:42:04,038 INFO L226 Difference]: Without dead ends: 77500 [2018-10-25 01:42:04,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:42:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77500 states. [2018-10-25 01:42:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77500 to 77354. [2018-10-25 01:42:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77354 states. [2018-10-25 01:42:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77354 states to 77354 states and 106162 transitions. [2018-10-25 01:42:05,725 INFO L78 Accepts]: Start accepts. Automaton has 77354 states and 106162 transitions. Word has length 178 [2018-10-25 01:42:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:05,726 INFO L481 AbstractCegarLoop]: Abstraction has 77354 states and 106162 transitions. [2018-10-25 01:42:05,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 77354 states and 106162 transitions. [2018-10-25 01:42:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 01:42:05,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:05,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:05,730 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:05,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 73089436, now seen corresponding path program 1 times [2018-10-25 01:42:05,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:05,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:05,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:06,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:06,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:06,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 01:42:06,076 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], [2175], [2177], [2180], [2188], [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], [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], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:42:06,086 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:06,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:07,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:42:07,708 INFO L272 AbstractInterpreter]: Visited 158 different actions 309 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:42:07,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:07,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:42:07,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:07,747 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:42:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:07,759 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:42:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:07,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:42:08,877 WARN L179 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 22 [2018-10-25 01:42:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:09,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:42:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:42:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-25 01:42:09,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:09,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:42:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:42:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:09,507 INFO L87 Difference]: Start difference. First operand 77354 states and 106162 transitions. Second operand 3 states. [2018-10-25 01:42:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:20,033 INFO L93 Difference]: Finished difference Result 182776 states and 256284 transitions. [2018-10-25 01:42:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:42:20,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-25 01:42:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:20,348 INFO L225 Difference]: With dead ends: 182776 [2018-10-25 01:42:20,348 INFO L226 Difference]: Without dead ends: 105428 [2018-10-25 01:42:20,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105428 states. [2018-10-25 01:42:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105428 to 105333. [2018-10-25 01:42:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105333 states. [2018-10-25 01:42:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105333 states to 105333 states and 141734 transitions. [2018-10-25 01:42:22,516 INFO L78 Accepts]: Start accepts. Automaton has 105333 states and 141734 transitions. Word has length 201 [2018-10-25 01:42:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:22,517 INFO L481 AbstractCegarLoop]: Abstraction has 105333 states and 141734 transitions. [2018-10-25 01:42:22,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:42:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 105333 states and 141734 transitions. [2018-10-25 01:42:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 01:42:22,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:22,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:22,523 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:22,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash 733180128, now seen corresponding path program 1 times [2018-10-25 01:42:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:22,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:22,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:22,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:22,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:22,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:22,832 INFO L87 Difference]: Start difference. First operand 105333 states and 141734 transitions. Second operand 6 states. [2018-10-25 01:42:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:32,429 INFO L93 Difference]: Finished difference Result 256628 states and 367726 transitions. [2018-10-25 01:42:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:32,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-10-25 01:42:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:32,926 INFO L225 Difference]: With dead ends: 256628 [2018-10-25 01:42:32,926 INFO L226 Difference]: Without dead ends: 151301 [2018-10-25 01:42:33,114 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:42:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151301 states. [2018-10-25 01:42:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151301 to 150996. [2018-10-25 01:42:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150996 states. [2018-10-25 01:42:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150996 states to 150996 states and 208214 transitions. [2018-10-25 01:42:36,635 INFO L78 Accepts]: Start accepts. Automaton has 150996 states and 208214 transitions. Word has length 219 [2018-10-25 01:42:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:36,635 INFO L481 AbstractCegarLoop]: Abstraction has 150996 states and 208214 transitions. [2018-10-25 01:42:36,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150996 states and 208214 transitions. [2018-10-25 01:42:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 01:42:36,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:36,641 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:42:36,642 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:36,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash -88101080, now seen corresponding path program 1 times [2018-10-25 01:42:36,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:36,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:36,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:36,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:36,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:36,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:36,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:36,894 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-10-25 01:42:36,894 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], [2175], [2177], [2180], [2188], [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], [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], [2540], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:42:36,900 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:36,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:37,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:42:37,953 INFO L272 AbstractInterpreter]: Visited 124 different actions 370 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-10-25 01:42:37,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:37,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:42:37,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:37,989 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:42:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:38,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:42:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:38,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:42:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:38,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:42:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:38,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:42:38,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 01:42:38,350 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:42:38,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 01:42:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 01:42:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-25 01:42:38,351 INFO L87 Difference]: Start difference. First operand 150996 states and 208214 transitions. Second operand 9 states. [2018-10-25 01:43:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:06,765 INFO L93 Difference]: Finished difference Result 452094 states and 845200 transitions. [2018-10-25 01:43:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 01:43:06,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2018-10-25 01:43:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:08,376 INFO L225 Difference]: With dead ends: 452094 [2018-10-25 01:43:08,376 INFO L226 Difference]: Without dead ends: 249838 [2018-10-25 01:43:16,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 489 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2018-10-25 01:43:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249838 states. [2018-10-25 01:43:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249838 to 241971. [2018-10-25 01:43:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241971 states. [2018-10-25 01:43:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241971 states to 241971 states and 348875 transitions. [2018-10-25 01:43:22,776 INFO L78 Accepts]: Start accepts. Automaton has 241971 states and 348875 transitions. Word has length 242 [2018-10-25 01:43:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:22,776 INFO L481 AbstractCegarLoop]: Abstraction has 241971 states and 348875 transitions. [2018-10-25 01:43:22,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 01:43:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 241971 states and 348875 transitions. [2018-10-25 01:43:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-25 01:43:22,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:22,781 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:43:22,781 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:22,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:22,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1044267349, now seen corresponding path program 1 times [2018-10-25 01:43:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:22,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:22,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:22,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:22,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:23,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:43:23,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:43:23,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-10-25 01:43:23,057 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], [2175], [2177], [2180], [2188], [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], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2420], [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], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2676], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:43:23,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:43:23,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:43:23,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:43:23,273 INFO L272 AbstractInterpreter]: Visited 154 different actions 154 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:43:23,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:23,311 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:43:23,826 INFO L232 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 75.47% of their original sizes. [2018-10-25 01:43:23,826 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:43:23,889 INFO L413 sIntCurrentIteration]: We have 284 unified AI predicates [2018-10-25 01:43:23,889 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:43:23,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:43:23,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:43:23,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:23,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:23,892 INFO L87 Difference]: Start difference. First operand 241971 states and 348875 transitions. Second operand 6 states. [2018-10-25 01:43:54,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:43:54,989 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:43:54,994 INFO L168 Benchmark]: Toolchain (without parser) took 214147.88 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -357.9 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,995 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:43:54,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2114.34 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 471.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.1 MB). Free memory was 1.2 GB in the beginning and 2.2 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:43:54,997 INFO L168 Benchmark]: Boogie Preprocessor took 322.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,998 INFO L168 Benchmark]: RCFGBuilder took 13511.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 175.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -174.8 MB). Peak memory consumption was 667.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:54,999 INFO L168 Benchmark]: TraceAbstraction took 197721.99 ms. Allocated memory was 2.5 GB in the beginning and 5.3 GB in the end (delta: 2.8 GB). Free memory was 2.4 GB in the beginning and 1.8 GB in the end (delta: 627.2 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:55,008 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.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2114.34 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 471.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 322.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13511.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 175.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -174.8 MB). Peak memory consumption was 667.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197721.99 ms. Allocated memory was 2.5 GB in the beginning and 5.3 GB in the end (delta: 2.8 GB). Free memory was 2.4 GB in the beginning and 1.8 GB in the end (delta: 627.2 MB). Peak memory consumption was 3.5 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...