java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label44_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:36:26,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:36:26,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:36:26,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:36:26,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:36:26,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:36:26,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:36:26,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:36:26,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:36:26,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:36:26,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:36:26,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:36:26,347 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:36:26,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:36:26,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:36:26,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:36:26,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:36:26,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:36:26,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:36:26,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:36:26,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:36:26,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:36:26,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:36:26,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:36:26,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:36:26,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:36:26,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:36:26,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:36:26,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:36:26,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:36:26,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:36:26,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:36:26,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:36:26,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:36:26,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:36:26,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:36:26,381 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-24 23:36:26,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:36:26,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:36:26,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:36:26,411 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:36:26,411 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:36:26,411 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:36:26,412 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:36:26,413 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:36:26,414 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:36:26,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:36:26,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:36:26,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:36:26,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:36:26,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:36:26,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:36:26,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:36:26,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:36:26,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:36:26,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:36:26,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:36:26,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:36:26,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:36:26,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:36:26,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:36:26,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:36:26,422 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:36:26,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:36:26,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:36:26,423 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:36:26,423 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:36:26,423 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:36:26,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:36:26,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:36:26,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:36:26,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:36:26,504 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:36:26,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label44_false-unreach-call.c [2018-10-24 23:36:26,585 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e84c076ab/17bd5cbadffc44d69e52001cd0ca2db7/FLAG053624b18 [2018-10-24 23:36:27,431 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:36:27,432 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label44_false-unreach-call.c [2018-10-24 23:36:27,472 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e84c076ab/17bd5cbadffc44d69e52001cd0ca2db7/FLAG053624b18 [2018-10-24 23:36:27,492 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e84c076ab/17bd5cbadffc44d69e52001cd0ca2db7 [2018-10-24 23:36:27,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:36:27,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:36:27,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:27,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:36:27,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:36:27,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:27" (1/1) ... [2018-10-24 23:36:27,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:27, skipping insertion in model container [2018-10-24 23:36:27,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:27" (1/1) ... [2018-10-24 23:36:27,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:36:27,733 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:36:29,264 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:29,268 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:36:29,951 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:29,992 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:36:29,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29 WrapperNode [2018-10-24 23:36:29,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:29,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:29,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:36:29,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:36:30,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:30,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:36:30,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:36:30,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:36:30,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (1/1) ... [2018-10-24 23:36:30,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:36:30,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:36:30,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:36:30,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:36:30,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (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-24 23:36:30,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:36:30,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:36:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:36:30,961 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:36:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:36:30,962 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:36:30,962 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:36:30,962 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:36:30,962 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:36:30,962 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:36:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:36:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:36:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:36:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:36:42,039 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:36:42,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:42 BoogieIcfgContainer [2018-10-24 23:36:42,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:36:42,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:36:42,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:36:42,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:36:42,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:36:27" (1/3) ... [2018-10-24 23:36:42,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756ed02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:42, skipping insertion in model container [2018-10-24 23:36:42,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:29" (2/3) ... [2018-10-24 23:36:42,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756ed02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:42, skipping insertion in model container [2018-10-24 23:36:42,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:42" (3/3) ... [2018-10-24 23:36:42,053 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label44_false-unreach-call.c [2018-10-24 23:36:42,066 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:36:42,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:36:42,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:36:42,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:36:42,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:36:42,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:36:42,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:36:42,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:36:42,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:36:42,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:36:42,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:36:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:36:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 23:36:42,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:42,242 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] [2018-10-24 23:36:42,247 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:42,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1095367477, now seen corresponding path program 1 times [2018-10-24 23:36:42,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:42,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:42,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:42,779 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:36:42,923 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-24 23:36:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:36:42,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:42,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:36:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:36:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:36:42,984 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-24 23:36:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:51,562 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-24 23:36:51,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:36:51,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-24 23:36:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:51,601 INFO L225 Difference]: With dead ends: 3097 [2018-10-24 23:36:51,602 INFO L226 Difference]: Without dead ends: 1975 [2018-10-24 23:36:51,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:36:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-24 23:36:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-24 23:36:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-24 23:36:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-24 23:36:51,788 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 37 [2018-10-24 23:36:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:51,789 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-24 23:36:51,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:36:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-24 23:36:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 23:36:51,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:51,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:36:51,797 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:51,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1403714778, now seen corresponding path program 1 times [2018-10-24 23:36:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:51,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:52,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:52,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:52,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:52,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:52,278 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-24 23:37:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:16,968 INFO L93 Difference]: Finished difference Result 5737 states and 9691 transitions. [2018-10-24 23:37:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:16,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-10-24 23:37:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:16,992 INFO L225 Difference]: With dead ends: 5737 [2018-10-24 23:37:16,993 INFO L226 Difference]: Without dead ends: 3769 [2018-10-24 23:37:16,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2018-10-24 23:37:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3685. [2018-10-24 23:37:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3685 states. [2018-10-24 23:37:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 5659 transitions. [2018-10-24 23:37:17,118 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 5659 transitions. Word has length 113 [2018-10-24 23:37:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:17,118 INFO L481 AbstractCegarLoop]: Abstraction has 3685 states and 5659 transitions. [2018-10-24 23:37:17,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 5659 transitions. [2018-10-24 23:37:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 23:37:17,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:17,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:37:17,132 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:17,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2119578826, now seen corresponding path program 1 times [2018-10-24 23:37:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:17,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:17,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:17,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:17,382 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:17,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:17,383 INFO L87 Difference]: Start difference. First operand 3685 states and 5659 transitions. Second operand 5 states. [2018-10-24 23:37:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:51,634 INFO L93 Difference]: Finished difference Result 13663 states and 21758 transitions. [2018-10-24 23:37:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:51,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-24 23:37:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:51,694 INFO L225 Difference]: With dead ends: 13663 [2018-10-24 23:37:51,694 INFO L226 Difference]: Without dead ends: 9984 [2018-10-24 23:37:51,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9984 states. [2018-10-24 23:37:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9984 to 9792. [2018-10-24 23:37:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9792 states. [2018-10-24 23:37:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 14498 transitions. [2018-10-24 23:37:52,040 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 14498 transitions. Word has length 127 [2018-10-24 23:37:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:52,040 INFO L481 AbstractCegarLoop]: Abstraction has 9792 states and 14498 transitions. [2018-10-24 23:37:52,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 14498 transitions. [2018-10-24 23:37:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-24 23:37:52,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:52,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:37:52,050 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:52,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1301512730, now seen corresponding path program 1 times [2018-10-24 23:37:52,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:52,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:52,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:52,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:52,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:37:52,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:52,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:52,353 INFO L87 Difference]: Start difference. First operand 9792 states and 14498 transitions. Second operand 6 states. [2018-10-24 23:38:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:06,619 INFO L93 Difference]: Finished difference Result 34185 states and 53801 transitions. [2018-10-24 23:38:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:06,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-24 23:38:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:06,769 INFO L225 Difference]: With dead ends: 34185 [2018-10-24 23:38:06,769 INFO L226 Difference]: Without dead ends: 24399 [2018-10-24 23:38:06,842 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-24 23:38:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24399 states. [2018-10-24 23:38:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24399 to 24166. [2018-10-24 23:38:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24166 states. [2018-10-24 23:38:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24166 states to 24166 states and 34069 transitions. [2018-10-24 23:38:07,483 INFO L78 Accepts]: Start accepts. Automaton has 24166 states and 34069 transitions. Word has length 145 [2018-10-24 23:38:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:07,484 INFO L481 AbstractCegarLoop]: Abstraction has 24166 states and 34069 transitions. [2018-10-24 23:38:07,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24166 states and 34069 transitions. [2018-10-24 23:38:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-24 23:38:07,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:07,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:38:07,492 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:07,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 351230122, now seen corresponding path program 1 times [2018-10-24 23:38:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:07,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:07,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:38:07,742 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:07,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:38:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:38:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:07,743 INFO L87 Difference]: Start difference. First operand 24166 states and 34069 transitions. Second operand 4 states. [2018-10-24 23:38:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:19,874 INFO L93 Difference]: Finished difference Result 66683 states and 100101 transitions. [2018-10-24 23:38:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:38:19,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-10-24 23:38:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:20,053 INFO L225 Difference]: With dead ends: 66683 [2018-10-24 23:38:20,054 INFO L226 Difference]: Without dead ends: 42523 [2018-10-24 23:38:20,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42523 states. [2018-10-24 23:38:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42523 to 42460. [2018-10-24 23:38:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42460 states. [2018-10-24 23:38:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42460 states to 42460 states and 59964 transitions. [2018-10-24 23:38:21,184 INFO L78 Accepts]: Start accepts. Automaton has 42460 states and 59964 transitions. Word has length 153 [2018-10-24 23:38:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:21,185 INFO L481 AbstractCegarLoop]: Abstraction has 42460 states and 59964 transitions. [2018-10-24 23:38:21,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:38:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 42460 states and 59964 transitions. [2018-10-24 23:38:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 23:38:21,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:21,219 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-24 23:38:21,219 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:21,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash -215837280, now seen corresponding path program 1 times [2018-10-24 23:38:21,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:21,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:21,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:21,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:21,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:21,880 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-10-24 23:38:22,230 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 23:38:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 90 proven. 144 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 23:38:22,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:22,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:22,527 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-10-24 23:38:22,530 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2823], [2825], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3159], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:38:22,605 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:22,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:26,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:26,692 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:38:26,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:26,734 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:31,017 INFO L232 lantSequenceWeakener]: Weakened 273 states. On average, predicates are now at 71.06% of their original sizes. [2018-10-24 23:38:31,018 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:31,111 INFO L413 sIntCurrentIteration]: We have 284 unified AI predicates [2018-10-24 23:38:31,112 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:31,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:31,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:38:31,113 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:31,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:31,114 INFO L87 Difference]: Start difference. First operand 42460 states and 59964 transitions. Second operand 6 states. [2018-10-24 23:38:34,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:38:34,987 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:38:34,993 INFO L168 Benchmark]: Toolchain (without parser) took 127486.25 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -627.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 23:38:34,994 INFO L168 Benchmark]: CDTParser took 0.22 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-24 23:38:34,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2484.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:34,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 599.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:34,997 INFO L168 Benchmark]: Boogie Preprocessor took 293.62 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:34,998 INFO L168 Benchmark]: RCFGBuilder took 11155.99 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 187.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 5.8 MB). Peak memory consumption was 659.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:34,999 INFO L168 Benchmark]: TraceAbstraction took 112946.91 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 153.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 23:38:35,005 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.22 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 2484.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 599.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 293.62 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11155.99 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 187.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 5.8 MB). Peak memory consumption was 659.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112946.91 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 153.8 MB). Peak memory consumption was 1.4 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...