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/Problem18_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:05:32,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:05:32,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:05:32,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:05:32,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:05:32,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:05:32,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:05:32,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:05:32,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:05:32,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:05:32,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:05:32,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:05:32,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:05:32,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:05:32,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:05:32,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:05:32,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:05:32,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:05:32,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:05:32,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:05:32,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:05:32,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:05:32,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:05:32,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:05:32,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:05:32,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:05:32,314 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:05:32,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:05:32,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:05:32,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:05:32,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:05:32,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:05:32,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:05:32,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:05:32,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:05:32,324 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:05:32,325 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 02:05:32,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:05:32,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:05:32,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:05:32,359 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:05:32,359 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:05:32,360 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:05:32,360 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:05:32,360 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:05:32,360 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:05:32,361 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:05:32,361 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:05:32,361 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:05:32,361 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:05:32,361 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:05:32,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:05:32,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:05:32,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:05:32,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:05:32,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:05:32,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:05:32,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:05:32,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:05:32,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:05:32,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:05:32,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:05:32,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:05:32,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:05:32,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:05:32,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:05:32,367 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:05:32,367 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:05:32,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:05:32,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:05:32,368 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:05:32,369 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:05:32,369 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:05:32,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:05:32,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:05:32,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:05:32,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:05:32,460 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:05:32,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label23_true-unreach-call.c [2018-10-25 02:05:32,524 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95471a6ed/208c23a14111488a840a2164fb1bda0b/FLAG590d8fce1 [2018-10-25 02:05:33,217 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:05:33,218 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label23_true-unreach-call.c [2018-10-25 02:05:33,253 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95471a6ed/208c23a14111488a840a2164fb1bda0b/FLAG590d8fce1 [2018-10-25 02:05:33,274 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95471a6ed/208c23a14111488a840a2164fb1bda0b [2018-10-25 02:05:33,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:05:33,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:05:33,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:05:33,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:05:33,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:05:33,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:05:33" (1/1) ... [2018-10-25 02:05:33,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b704e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:33, skipping insertion in model container [2018-10-25 02:05:33,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:05:33" (1/1) ... [2018-10-25 02:05:33,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:05:33,468 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:05:34,511 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:05:34,515 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:05:34,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:05:35,000 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:05:35,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35 WrapperNode [2018-10-25 02:05:35,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:05:35,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:05:35,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:05:35,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:05:35,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:05:35,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:05:35,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:05:35,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:05:35,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (1/1) ... [2018-10-25 02:05:35,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:05:35,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:05:35,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:05:35,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:05:35,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (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 02:05:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:05:35,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:05:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:05:35,770 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:05:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:05:35,770 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:05:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:05:35,771 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:05:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:05:35,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:05:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:05:35,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:05:43,752 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:05:43,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:05:43 BoogieIcfgContainer [2018-10-25 02:05:43,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:05:43,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:05:43,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:05:43,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:05:43,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:05:33" (1/3) ... [2018-10-25 02:05:43,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:05:43, skipping insertion in model container [2018-10-25 02:05:43,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:05:35" (2/3) ... [2018-10-25 02:05:43,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:05:43, skipping insertion in model container [2018-10-25 02:05:43,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:05:43" (3/3) ... [2018-10-25 02:05:43,765 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label23_true-unreach-call.c [2018-10-25 02:05:43,776 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:05:43,789 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:05:43,807 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:05:43,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:05:43,870 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:05:43,870 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:05:43,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:05:43,871 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:05:43,871 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:05:43,871 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:05:43,871 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:05:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:05:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-25 02:05:43,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:43,927 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] [2018-10-25 02:05:43,930 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1417281084, now seen corresponding path program 1 times [2018-10-25 02:05:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:43,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:43,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:43,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:43,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:44,481 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:44,555 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 02:05:44,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:44,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:05:44,558 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:44,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:05:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:05:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:05:44,583 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-25 02:05:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:51,674 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-25 02:05:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:05:51,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-25 02:05:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:51,709 INFO L225 Difference]: With dead ends: 2251 [2018-10-25 02:05:51,710 INFO L226 Difference]: Without dead ends: 1474 [2018-10-25 02:05:51,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:05:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-25 02:05:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-25 02:05:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:05:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2721 transitions. [2018-10-25 02:05:51,898 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2721 transitions. Word has length 62 [2018-10-25 02:05:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:51,899 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2721 transitions. [2018-10-25 02:05:51,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:05:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2721 transitions. [2018-10-25 02:05:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 02:05:51,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:51,913 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, 1, 1, 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 02:05:51,913 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:51,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash 586978190, now seen corresponding path program 1 times [2018-10-25 02:05:51,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:51,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:51,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:51,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:52,226 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:52,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:52,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:05:52,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:52,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:05:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:05:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:05:52,259 INFO L87 Difference]: Start difference. First operand 1474 states and 2721 transitions. Second operand 5 states. [2018-10-25 02:05:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:59,907 INFO L93 Difference]: Finished difference Result 3698 states and 6787 transitions. [2018-10-25 02:05:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:05:59,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-25 02:05:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:59,922 INFO L225 Difference]: With dead ends: 3698 [2018-10-25 02:05:59,922 INFO L226 Difference]: Without dead ends: 2230 [2018-10-25 02:05:59,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:05:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-10-25 02:05:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2209. [2018-10-25 02:05:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-10-25 02:06:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3833 transitions. [2018-10-25 02:06:00,000 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3833 transitions. Word has length 134 [2018-10-25 02:06:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:00,001 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 3833 transitions. [2018-10-25 02:06:00,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:06:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3833 transitions. [2018-10-25 02:06:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 02:06:00,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:00,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:06:00,015 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:00,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash -171937505, now seen corresponding path program 1 times [2018-10-25 02:06:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:00,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:00,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:00,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:06:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:06:00,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:06:00,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:00,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:00,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:00,295 INFO L87 Difference]: Start difference. First operand 2209 states and 3833 transitions. Second operand 6 states. [2018-10-25 02:06:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:08,186 INFO L93 Difference]: Finished difference Result 5866 states and 10122 transitions. [2018-10-25 02:06:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:06:08,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-10-25 02:06:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:08,215 INFO L225 Difference]: With dead ends: 5866 [2018-10-25 02:06:08,216 INFO L226 Difference]: Without dead ends: 3663 [2018-10-25 02:06:08,226 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 02:06:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2018-10-25 02:06:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3639. [2018-10-25 02:06:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-25 02:06:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5517 transitions. [2018-10-25 02:06:08,326 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5517 transitions. Word has length 157 [2018-10-25 02:06:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:08,327 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 5517 transitions. [2018-10-25 02:06:08,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:06:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5517 transitions. [2018-10-25 02:06:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 02:06:08,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:08,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:06:08,330 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:08,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash -96062505, now seen corresponding path program 1 times [2018-10-25 02:06:08,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:08,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:08,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:08,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:08,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:06:08,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:06:08,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:06:08,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:08,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:08,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:08,596 INFO L87 Difference]: Start difference. First operand 3639 states and 5517 transitions. Second operand 6 states. [2018-10-25 02:06:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:17,273 INFO L93 Difference]: Finished difference Result 8735 states and 13271 transitions. [2018-10-25 02:06:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:06:17,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-10-25 02:06:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:17,300 INFO L225 Difference]: With dead ends: 8735 [2018-10-25 02:06:17,301 INFO L226 Difference]: Without dead ends: 5102 [2018-10-25 02:06:17,313 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 02:06:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2018-10-25 02:06:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5084. [2018-10-25 02:06:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5084 states. [2018-10-25 02:06:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 6940 transitions. [2018-10-25 02:06:17,426 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 6940 transitions. Word has length 161 [2018-10-25 02:06:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:17,427 INFO L481 AbstractCegarLoop]: Abstraction has 5084 states and 6940 transitions. [2018-10-25 02:06:17,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:06:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6940 transitions. [2018-10-25 02:06:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-25 02:06:17,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:17,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:06:17,432 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:17,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1854006202, now seen corresponding path program 1 times [2018-10-25 02:06:17,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:17,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:17,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:17,736 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:06:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:06:17,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:06:17,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:06:17,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:17,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:17,976 INFO L87 Difference]: Start difference. First operand 5084 states and 6940 transitions. Second operand 6 states. [2018-10-25 02:06:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:23,646 INFO L93 Difference]: Finished difference Result 13307 states and 18750 transitions. [2018-10-25 02:06:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:06:23,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-10-25 02:06:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:23,681 INFO L225 Difference]: With dead ends: 13307 [2018-10-25 02:06:23,681 INFO L226 Difference]: Without dead ends: 8229 [2018-10-25 02:06:23,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:06:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2018-10-25 02:06:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8128. [2018-10-25 02:06:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8128 states. [2018-10-25 02:06:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 10817 transitions. [2018-10-25 02:06:23,898 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 10817 transitions. Word has length 192 [2018-10-25 02:06:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:23,899 INFO L481 AbstractCegarLoop]: Abstraction has 8128 states and 10817 transitions. [2018-10-25 02:06:23,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:06:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 10817 transitions. [2018-10-25 02:06:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-25 02:06:23,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:23,907 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, 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] [2018-10-25 02:06:23,908 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:23,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1030698289, now seen corresponding path program 1 times [2018-10-25 02:06:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:23,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:23,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 110 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:06:24,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:06:24,355 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:06:24,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-10-25 02:06:24,358 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1999], [2007], [2015], [2019], [2021], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2124], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2200], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:06:24,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:06:24,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:06:24,966 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:06:24,971 INFO L272 AbstractInterpreter]: Visited 96 different actions 96 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:06:25,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:25,017 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:06:25,579 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 78.24% of their original sizes. [2018-10-25 02:06:25,579 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:06:25,831 INFO L413 sIntCurrentIteration]: We have 224 unified AI predicates [2018-10-25 02:06:25,831 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:06:25,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:06:25,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 02:06:25,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:25,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:25,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:25,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:25,834 INFO L87 Difference]: Start difference. First operand 8128 states and 10817 transitions. Second operand 6 states. [2018-10-25 02:06:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:06:29,928 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.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 02:06:29,934 INFO L168 Benchmark]: Toolchain (without parser) took 56643.86 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -495.0 MB). Peak memory consumption was 762.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,935 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 02:06:29,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1707.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 439.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 786.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -962.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,938 INFO L168 Benchmark]: Boogie Preprocessor took 258.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,939 INFO L168 Benchmark]: RCFGBuilder took 8051.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 502.6 MB). Peak memory consumption was 502.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,940 INFO L168 Benchmark]: TraceAbstraction took 46176.41 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 471.3 MB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -197.7 MB). Peak memory consumption was 273.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:29,945 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 1707.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 439.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 786.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -962.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 258.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8051.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 502.6 MB). Peak memory consumption was 502.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46176.41 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 471.3 MB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -197.7 MB). Peak memory consumption was 273.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...