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/Problem13_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:44:12,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:44:12,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:44:12,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:44:12,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:44:12,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:44:12,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:44:12,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:44:12,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:44:12,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:44:12,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:44:12,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:44:12,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:44:12,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:44:12,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:44:12,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:44:12,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:44:12,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:44:12,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:44:12,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:44:12,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:44:12,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:44:12,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:44:12,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:44:12,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:44:12,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:44:12,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:44:12,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:44:12,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:44:12,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:44:12,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:44:12,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:44:12,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:44:12,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:44:12,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:44:12,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:44:12,989 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:44:13,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:44:13,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:44:13,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:44:13,021 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:44:13,021 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:44:13,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:44:13,022 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:44:13,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:44:13,022 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:44:13,023 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:44:13,023 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:44:13,023 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:44:13,024 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:44:13,024 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:44:13,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:44:13,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:44:13,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:44:13,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:44:13,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:44:13,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:44:13,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:44:13,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:44:13,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:44:13,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:44:13,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:44:13,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:44:13,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:44:13,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:44:13,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:44:13,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:44:13,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:44:13,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:44:13,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:44:13,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:44:13,031 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:44:13,031 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:44:13,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:44:13,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:44:13,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:44:13,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:44:13,128 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:44:13,129 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-10-25 01:44:13,187 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b152c3e8b/ccf35521edf54318b296bd6cdcefe21b/FLAG50082bbf1 [2018-10-25 01:44:14,039 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:44:14,040 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-10-25 01:44:14,079 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b152c3e8b/ccf35521edf54318b296bd6cdcefe21b/FLAG50082bbf1 [2018-10-25 01:44:14,096 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b152c3e8b/ccf35521edf54318b296bd6cdcefe21b [2018-10-25 01:44:14,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:44:14,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:44:14,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:14,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:44:14,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:44:14,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:44:14" (1/1) ... [2018-10-25 01:44:14,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4569e7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:14, skipping insertion in model container [2018-10-25 01:44:14,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:44:14" (1/1) ... [2018-10-25 01:44:14,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:44:14,328 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:44:15,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:15,790 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:44:16,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:16,615 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:44:16,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16 WrapperNode [2018-10-25 01:44:16,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:16,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:16,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:44:16,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:44:16,628 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:44:16" (1/1) ... [2018-10-25 01:44:16,701 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:44:16" (1/1) ... [2018-10-25 01:44:17,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:17,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:44:17,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:44:17,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:44:17,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (1/1) ... [2018-10-25 01:44:17,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:44:17,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:44:17,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:44:17,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:44:17,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (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:44:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:44:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:44:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:44:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:44:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:44:17,535 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:44:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:44:17,535 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:44:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:44:17,536 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:44:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:44:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:44:17,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:44:17,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:44:30,985 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:44:30,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:30 BoogieIcfgContainer [2018-10-25 01:44:30,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:44:30,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:44:30,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:44:30,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:44:30,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:44:14" (1/3) ... [2018-10-25 01:44:30,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ec2112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:30, skipping insertion in model container [2018-10-25 01:44:30,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:16" (2/3) ... [2018-10-25 01:44:30,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ec2112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:30, skipping insertion in model container [2018-10-25 01:44:30,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:30" (3/3) ... [2018-10-25 01:44:30,995 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label52_true-unreach-call.c [2018-10-25 01:44:31,005 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:44:31,020 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:44:31,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:44:31,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:44:31,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:44:31,084 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:44:31,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:44:31,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:44:31,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:44:31,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:44:31,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:44:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:44:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-25 01:44:31,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:31,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:31,144 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:31,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash -774157709, now seen corresponding path program 1 times [2018-10-25 01:44:31,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:31,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:31,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:31,739 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:44:31,870 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:44:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:44:31,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:31,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:44:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:44:31,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:44:31,899 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:44:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:42,333 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-10-25 01:44:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:44:42,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-25 01:44:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:42,375 INFO L225 Difference]: With dead ends: 3093 [2018-10-25 01:44:42,375 INFO L226 Difference]: Without dead ends: 1971 [2018-10-25 01:44:42,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:44:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-10-25 01:44:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-10-25 01:44:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-10-25 01:44:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-10-25 01:44:42,576 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 71 [2018-10-25 01:44:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:42,577 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-10-25 01:44:42,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:44:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-10-25 01:44:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-25 01:44:42,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:42,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:44:42,596 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:42,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1438454356, now seen corresponding path program 1 times [2018-10-25 01:44:42,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:42,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:42,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:43,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:43,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:43,247 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:43,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:43,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:43,251 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-10-25 01:45:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:00,909 INFO L93 Difference]: Finished difference Result 5630 states and 10205 transitions. [2018-10-25 01:45:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:00,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-10-25 01:45:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:00,940 INFO L225 Difference]: With dead ends: 5630 [2018-10-25 01:45:00,940 INFO L226 Difference]: Without dead ends: 3679 [2018-10-25 01:45:00,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:45:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2018-10-25 01:45:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3636. [2018-10-25 01:45:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-10-25 01:45:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5828 transitions. [2018-10-25 01:45:01,068 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5828 transitions. Word has length 154 [2018-10-25 01:45:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:01,069 INFO L481 AbstractCegarLoop]: Abstraction has 3636 states and 5828 transitions. [2018-10-25 01:45:01,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5828 transitions. [2018-10-25 01:45:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 01:45:01,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:01,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45:01,079 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:01,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1449223166, now seen corresponding path program 1 times [2018-10-25 01:45:01,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:01,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:01,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:01,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:01,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:01,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:01,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:45:01,270 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:01,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:45:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:45:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:45:01,272 INFO L87 Difference]: Start difference. First operand 3636 states and 5828 transitions. Second operand 5 states. [2018-10-25 01:45:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:24,447 INFO L93 Difference]: Finished difference Result 13464 states and 21920 transitions. [2018-10-25 01:45:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:45:24,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-10-25 01:45:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:24,501 INFO L225 Difference]: With dead ends: 13464 [2018-10-25 01:45:24,501 INFO L226 Difference]: Without dead ends: 9834 [2018-10-25 01:45:24,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:45:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2018-10-25 01:45:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9639. [2018-10-25 01:45:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9639 states. [2018-10-25 01:45:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9639 states to 9639 states and 14661 transitions. [2018-10-25 01:45:24,763 INFO L78 Accepts]: Start accepts. Automaton has 9639 states and 14661 transitions. Word has length 161 [2018-10-25 01:45:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:24,763 INFO L481 AbstractCegarLoop]: Abstraction has 9639 states and 14661 transitions. [2018-10-25 01:45:24,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9639 states and 14661 transitions. [2018-10-25 01:45:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:45:24,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:24,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:45:24,770 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:24,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2036148572, now seen corresponding path program 1 times [2018-10-25 01:45:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:24,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:24,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:25,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:45:25,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:25,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:45:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:45:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:45:25,124 INFO L87 Difference]: Start difference. First operand 9639 states and 14661 transitions. Second operand 5 states. [2018-10-25 01:45:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:41,073 INFO L93 Difference]: Finished difference Result 29017 states and 46093 transitions. [2018-10-25 01:45:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:45:41,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-10-25 01:45:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:41,189 INFO L225 Difference]: With dead ends: 29017 [2018-10-25 01:45:41,189 INFO L226 Difference]: Without dead ends: 19384 [2018-10-25 01:45:41,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:45:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19384 states. [2018-10-25 01:45:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19384 to 19049. [2018-10-25 01:45:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19049 states. [2018-10-25 01:45:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19049 states to 19049 states and 27578 transitions. [2018-10-25 01:45:41,782 INFO L78 Accepts]: Start accepts. Automaton has 19049 states and 27578 transitions. Word has length 170 [2018-10-25 01:45:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:41,784 INFO L481 AbstractCegarLoop]: Abstraction has 19049 states and 27578 transitions. [2018-10-25 01:45:41,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19049 states and 27578 transitions. [2018-10-25 01:45:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-25 01:45:41,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:41,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:45:41,793 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:41,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1111253638, now seen corresponding path program 1 times [2018-10-25 01:45:41,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:41,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:42,124 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:42,559 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:42,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:42,563 INFO L87 Difference]: Start difference. First operand 19049 states and 27578 transitions. Second operand 6 states. [2018-10-25 01:45:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:58,995 INFO L93 Difference]: Finished difference Result 58356 states and 91855 transitions. [2018-10-25 01:45:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:59,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-10-25 01:45:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:59,192 INFO L225 Difference]: With dead ends: 58356 [2018-10-25 01:45:59,193 INFO L226 Difference]: Without dead ends: 39313 [2018-10-25 01:45:59,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:45:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39313 states. [2018-10-25 01:46:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39313 to 39136. [2018-10-25 01:46:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39136 states. [2018-10-25 01:46:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39136 states to 39136 states and 54978 transitions. [2018-10-25 01:46:00,199 INFO L78 Accepts]: Start accepts. Automaton has 39136 states and 54978 transitions. Word has length 181 [2018-10-25 01:46:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:00,200 INFO L481 AbstractCegarLoop]: Abstraction has 39136 states and 54978 transitions. [2018-10-25 01:46:00,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:46:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39136 states and 54978 transitions. [2018-10-25 01:46:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 01:46:00,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:00,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:46:00,211 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:00,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -747971991, now seen corresponding path program 1 times [2018-10-25 01:46:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:00,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:00,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:00,499 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:46:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:00,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:00,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:46:00,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:00,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:46:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:46:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:46:00,555 INFO L87 Difference]: Start difference. First operand 39136 states and 54978 transitions. Second operand 6 states. [2018-10-25 01:46:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:09,524 INFO L93 Difference]: Finished difference Result 98860 states and 157126 transitions. [2018-10-25 01:46:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:46:09,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-10-25 01:46:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:09,778 INFO L225 Difference]: With dead ends: 98860 [2018-10-25 01:46:09,778 INFO L226 Difference]: Without dead ends: 59730 [2018-10-25 01:46:09,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:46:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59730 states. [2018-10-25 01:46:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59730 to 59501. [2018-10-25 01:46:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59501 states. [2018-10-25 01:46:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59501 states to 59501 states and 85525 transitions. [2018-10-25 01:46:11,170 INFO L78 Accepts]: Start accepts. Automaton has 59501 states and 85525 transitions. Word has length 190 [2018-10-25 01:46:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:11,170 INFO L481 AbstractCegarLoop]: Abstraction has 59501 states and 85525 transitions. [2018-10-25 01:46:11,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:46:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 59501 states and 85525 transitions. [2018-10-25 01:46:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-25 01:46:11,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:11,203 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:11,203 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:11,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:11,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1403677423, now seen corresponding path program 1 times [2018-10-25 01:46:11,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:11,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:11,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:11,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:11,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:11,943 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:46:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:12,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:12,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:46:12,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:12,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:46:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:46:12,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:46:12,259 INFO L87 Difference]: Start difference. First operand 59501 states and 85525 transitions. Second operand 6 states. [2018-10-25 01:46:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:20,125 INFO L93 Difference]: Finished difference Result 125382 states and 184783 transitions. [2018-10-25 01:46:20,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:46:20,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-10-25 01:46:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:20,354 INFO L225 Difference]: With dead ends: 125382 [2018-10-25 01:46:20,354 INFO L226 Difference]: Without dead ends: 65887 [2018-10-25 01:46:20,499 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:46:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65887 states. [2018-10-25 01:46:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65887 to 65760. [2018-10-25 01:46:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65760 states. [2018-10-25 01:46:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65760 states to 65760 states and 88954 transitions. [2018-10-25 01:46:22,116 INFO L78 Accepts]: Start accepts. Automaton has 65760 states and 88954 transitions. Word has length 265 [2018-10-25 01:46:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:22,117 INFO L481 AbstractCegarLoop]: Abstraction has 65760 states and 88954 transitions. [2018-10-25 01:46:22,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:46:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65760 states and 88954 transitions. [2018-10-25 01:46:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-25 01:46:22,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:22,148 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:22,148 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:22,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2001119171, now seen corresponding path program 1 times [2018-10-25 01:46:22,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:22,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:22,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:46:22,580 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:22,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:46:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:46:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:46:22,582 INFO L87 Difference]: Start difference. First operand 65760 states and 88954 transitions. Second operand 5 states. [2018-10-25 01:46:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:51,999 INFO L93 Difference]: Finished difference Result 167425 states and 237485 transitions. [2018-10-25 01:46:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:46:51,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2018-10-25 01:46:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:52,304 INFO L225 Difference]: With dead ends: 167425 [2018-10-25 01:46:52,304 INFO L226 Difference]: Without dead ends: 101671 [2018-10-25 01:46:52,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:46:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101671 states. [2018-10-25 01:46:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101671 to 101471. [2018-10-25 01:46:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101471 states. [2018-10-25 01:46:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101471 states to 101471 states and 142896 transitions. [2018-10-25 01:46:53,992 INFO L78 Accepts]: Start accepts. Automaton has 101471 states and 142896 transitions. Word has length 271 [2018-10-25 01:46:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:53,992 INFO L481 AbstractCegarLoop]: Abstraction has 101471 states and 142896 transitions. [2018-10-25 01:46:53,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:46:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 101471 states and 142896 transitions. [2018-10-25 01:46:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-25 01:46:54,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:54,020 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,021 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:54,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash -227591905, now seen corresponding path program 1 times [2018-10-25 01:46:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:54,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:54,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:55,021 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-25 01:46:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 205 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:56,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:46:56,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:46:56,227 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-10-25 01:46:56,229 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:46:56,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:46:56,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:46:56,908 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:46:56,910 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:46:56,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:56,956 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:46:57,713 INFO L232 lantSequenceWeakener]: Weakened 271 states. On average, predicates are now at 71.55% of their original sizes. [2018-10-25 01:46:57,713 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:46:57,850 INFO L413 sIntCurrentIteration]: We have 281 unified AI predicates [2018-10-25 01:46:57,851 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:46:57,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:46:57,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2018-10-25 01:46:57,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:57,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:46:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:46:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:46:57,854 INFO L87 Difference]: Start difference. First operand 101471 states and 142896 transitions. Second operand 6 states. [2018-10-25 01:47:06,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:47:06,484 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:47:06,491 INFO L168 Benchmark]: Toolchain (without parser) took 172383.35 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -273.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,492 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:47:06,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2506.65 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 529.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,494 INFO L168 Benchmark]: Boogie Preprocessor took 309.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,495 INFO L168 Benchmark]: RCFGBuilder took 13528.20 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 169.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 50.6 MB). Peak memory consumption was 646.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,496 INFO L168 Benchmark]: TraceAbstraction took 155503.45 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 483.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-25 01:47:06,502 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2506.65 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 529.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 309.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13528.20 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 169.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 50.6 MB). Peak memory consumption was 646.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155503.45 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 483.9 MB). Peak memory consumption was 1.9 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...