java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:39:37,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:39:37,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:39:37,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:39:37,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:39:37,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:39:37,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:39:37,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:39:37,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:39:37,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:39:37,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:39:37,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:39:37,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:39:37,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:39:37,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:39:37,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:39:37,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:39:37,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:39:37,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:39:37,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:39:37,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:39:37,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:39:37,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:39:37,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:39:37,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:39:37,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:39:37,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:39:37,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:39:37,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:39:37,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:39:37,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:39:37,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:39:37,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:39:37,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:39:37,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:39:37,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:39:37,305 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:39:37,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:39:37,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:39:37,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:39:37,322 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:39:37,322 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:39:37,322 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:39:37,322 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:39:37,323 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:39:37,323 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:39:37,323 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:39:37,323 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:39:37,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:39:37,324 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:39:37,324 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:39:37,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:39:37,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:39:37,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:39:37,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:39:37,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:39:37,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:39:37,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:39:37,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:39:37,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:39:37,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:39:37,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:39:37,327 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:39:37,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:39:37,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:39:37,328 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:39:37,328 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:39:37,329 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:39:37,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:39:37,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:39:37,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:39:37,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:39:37,426 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:39:37,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label49_true-unreach-call.c [2018-10-25 01:39:37,490 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71f96eb52/a876c712dd2941dfad248651d3a5eb49/FLAG9e6df247e [2018-10-25 01:39:38,263 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:39:38,264 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label49_true-unreach-call.c [2018-10-25 01:39:38,296 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71f96eb52/a876c712dd2941dfad248651d3a5eb49/FLAG9e6df247e [2018-10-25 01:39:38,318 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/71f96eb52/a876c712dd2941dfad248651d3a5eb49 [2018-10-25 01:39:38,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:39:38,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:39:38,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:38,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:39:38,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:39:38,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:38" (1/1) ... [2018-10-25 01:39:38,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769a0e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:38, skipping insertion in model container [2018-10-25 01:39:38,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:38" (1/1) ... [2018-10-25 01:39:38,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:39:38,527 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:39:39,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:39,859 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:39:40,505 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:40,543 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:39:40,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40 WrapperNode [2018-10-25 01:39:40,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:40,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:40,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:39:40,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:39:40,557 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:39:40" (1/1) ... [2018-10-25 01:39:40,633 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:39:40" (1/1) ... [2018-10-25 01:39:41,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:41,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:39:41,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:39:41,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:39:41,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (1/1) ... [2018-10-25 01:39:41,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:39:41,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:39:41,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:39:41,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:39:41,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (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:39:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:39:41,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:39:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:39:41,497 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:39:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:39:41,497 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:39:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:39:41,498 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:39:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:39:41,498 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:39:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:39:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:39:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:39:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:39:55,290 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:39:55,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:55 BoogieIcfgContainer [2018-10-25 01:39:55,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:39:55,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:39:55,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:39:55,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:39:55,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:39:38" (1/3) ... [2018-10-25 01:39:55,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52892750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:55, skipping insertion in model container [2018-10-25 01:39:55,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:40" (2/3) ... [2018-10-25 01:39:55,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52892750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:55, skipping insertion in model container [2018-10-25 01:39:55,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:55" (3/3) ... [2018-10-25 01:39:55,300 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label49_true-unreach-call.c [2018-10-25 01:39:55,310 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:39:55,319 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:39:55,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:39:55,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:39:55,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:39:55,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:39:55,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:39:55,382 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:39:55,382 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:39:55,382 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:39:55,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:39:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:39:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-25 01:39:55,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:55,436 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] [2018-10-25 01:39:55,438 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:55,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1466253757, now seen corresponding path program 1 times [2018-10-25 01:39:55,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:55,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:55,901 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:56,021 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:39:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:39:56,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:56,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:39:56,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:39:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:39:56,054 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:40:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:03,567 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:40:03,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:40:03,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-10-25 01:40:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:03,608 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:40:03,608 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:40:03,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:40:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:40:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:40:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:40:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3021 transitions. [2018-10-25 01:40:03,830 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3021 transitions. Word has length 49 [2018-10-25 01:40:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:03,831 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 3021 transitions. [2018-10-25 01:40:03,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:40:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3021 transitions. [2018-10-25 01:40:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:40:03,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:03,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:03,841 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:03,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1490932028, now seen corresponding path program 1 times [2018-10-25 01:40:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:03,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:03,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:03,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:03,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:04,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:04,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:04,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:04,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:04,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:04,261 INFO L87 Difference]: Start difference. First operand 1604 states and 3021 transitions. Second operand 6 states. [2018-10-25 01:40:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:21,635 INFO L93 Difference]: Finished difference Result 6333 states and 12134 transitions. [2018-10-25 01:40:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:40:21,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 01:40:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:21,671 INFO L225 Difference]: With dead ends: 6333 [2018-10-25 01:40:21,671 INFO L226 Difference]: Without dead ends: 4735 [2018-10-25 01:40:21,681 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 01:40:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2018-10-25 01:40:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4700. [2018-10-25 01:40:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4700 states. [2018-10-25 01:40:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4700 states and 7676 transitions. [2018-10-25 01:40:21,827 INFO L78 Accepts]: Start accepts. Automaton has 4700 states and 7676 transitions. Word has length 127 [2018-10-25 01:40:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:21,827 INFO L481 AbstractCegarLoop]: Abstraction has 4700 states and 7676 transitions. [2018-10-25 01:40:21,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4700 states and 7676 transitions. [2018-10-25 01:40:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 01:40:21,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:21,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:21,839 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:21,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash -729393447, now seen corresponding path program 1 times [2018-10-25 01:40:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:21,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:21,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:22,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:22,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:40:22,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:22,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:40:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:40:22,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:40:22,118 INFO L87 Difference]: Start difference. First operand 4700 states and 7676 transitions. Second operand 5 states. [2018-10-25 01:40:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:31,559 INFO L93 Difference]: Finished difference Result 14300 states and 23676 transitions. [2018-10-25 01:40:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:40:31,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 01:40:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:31,622 INFO L225 Difference]: With dead ends: 14300 [2018-10-25 01:40:31,622 INFO L226 Difference]: Without dead ends: 9606 [2018-10-25 01:40:31,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2018-10-25 01:40:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9524. [2018-10-25 01:40:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9524 states. [2018-10-25 01:40:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 14357 transitions. [2018-10-25 01:40:31,936 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 14357 transitions. Word has length 130 [2018-10-25 01:40:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:31,937 INFO L481 AbstractCegarLoop]: Abstraction has 9524 states and 14357 transitions. [2018-10-25 01:40:31,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:40:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 14357 transitions. [2018-10-25 01:40:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-25 01:40:31,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:31,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:31,946 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:31,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1452508056, now seen corresponding path program 1 times [2018-10-25 01:40:31,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:31,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:32,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:32,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:32,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:32,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:32,291 INFO L87 Difference]: Start difference. First operand 9524 states and 14357 transitions. Second operand 6 states. [2018-10-25 01:40:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:51,838 INFO L93 Difference]: Finished difference Result 38648 states and 64136 transitions. [2018-10-25 01:40:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:40:51,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-10-25 01:40:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:52,015 INFO L225 Difference]: With dead ends: 38648 [2018-10-25 01:40:52,015 INFO L226 Difference]: Without dead ends: 29130 [2018-10-25 01:40:52,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:40:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29130 states. [2018-10-25 01:40:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29130 to 28920. [2018-10-25 01:40:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28920 states. [2018-10-25 01:40:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28920 states to 28920 states and 42605 transitions. [2018-10-25 01:40:52,935 INFO L78 Accepts]: Start accepts. Automaton has 28920 states and 42605 transitions. Word has length 153 [2018-10-25 01:40:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:52,936 INFO L481 AbstractCegarLoop]: Abstraction has 28920 states and 42605 transitions. [2018-10-25 01:40:52,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28920 states and 42605 transitions. [2018-10-25 01:40:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 01:40:52,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:52,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:52,940 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:52,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1417457295, now seen corresponding path program 1 times [2018-10-25 01:40:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:52,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:53,208 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:53,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:53,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:53,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:53,632 INFO L87 Difference]: Start difference. First operand 28920 states and 42605 transitions. Second operand 6 states. [2018-10-25 01:41:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:04,869 INFO L93 Difference]: Finished difference Result 78897 states and 125125 transitions. [2018-10-25 01:41:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:04,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-10-25 01:41:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:05,098 INFO L225 Difference]: With dead ends: 78897 [2018-10-25 01:41:05,099 INFO L226 Difference]: Without dead ends: 49983 [2018-10-25 01:41:05,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49983 states. [2018-10-25 01:41:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49983 to 49774. [2018-10-25 01:41:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49774 states. [2018-10-25 01:41:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49774 states to 49774 states and 71861 transitions. [2018-10-25 01:41:06,704 INFO L78 Accepts]: Start accepts. Automaton has 49774 states and 71861 transitions. Word has length 174 [2018-10-25 01:41:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:06,705 INFO L481 AbstractCegarLoop]: Abstraction has 49774 states and 71861 transitions. [2018-10-25 01:41:06,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 49774 states and 71861 transitions. [2018-10-25 01:41:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-25 01:41:06,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:06,716 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:41:06,717 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:06,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1734956816, now seen corresponding path program 1 times [2018-10-25 01:41:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:06,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:07,015 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 84 proven. 76 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:41:07,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:41:07,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:41:07,189 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-10-25 01:41:07,191 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2159], [2161], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2404], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2536], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:41:07,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:41:07,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:41:09,130 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:41:09,131 INFO L272 AbstractInterpreter]: Visited 119 different actions 119 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:41:09,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:09,152 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:41:11,328 INFO L232 lantSequenceWeakener]: Weakened 235 states. On average, predicates are now at 75.52% of their original sizes. [2018-10-25 01:41:11,328 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:41:11,414 INFO L413 sIntCurrentIteration]: We have 243 unified AI predicates [2018-10-25 01:41:11,415 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:41:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:41:11,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:41:11,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:11,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:11,417 INFO L87 Difference]: Start difference. First operand 49774 states and 71861 transitions. Second operand 6 states. [2018-10-25 01:41:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:41:43,446 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:41:43,451 INFO L168 Benchmark]: Toolchain (without parser) took 125120.07 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -970.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,453 INFO L168 Benchmark]: CDTParser took 0.29 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:41:43,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2210.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 519.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,455 INFO L168 Benchmark]: Boogie Preprocessor took 351.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,456 INFO L168 Benchmark]: RCFGBuilder took 13874.78 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -186.4 MB). Peak memory consumption was 675.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,457 INFO L168 Benchmark]: TraceAbstraction took 108157.96 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 14.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:43,464 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.29 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 2210.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 519.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 351.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13874.78 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -186.4 MB). Peak memory consumption was 675.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108157.96 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 14.9 MB). Peak memory consumption was 1.6 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...