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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:57:04,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:57:04,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:57:04,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:57:04,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:57:04,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:57:04,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:57:04,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:57:04,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:57:04,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:57:04,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:57:04,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:57:04,255 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:57:04,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:57:04,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:57:04,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:57:04,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:57:04,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:57:04,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:57:04,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:57:04,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:57:04,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:57:04,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:57:04,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:57:04,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:57:04,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:57:04,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:57:04,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:57:04,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:57:04,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:57:04,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:57:04,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:57:04,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:57:04,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:57:04,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:57:04,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:57:04,278 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 00:57:04,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:57:04,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:57:04,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:57:04,296 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:57:04,296 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:57:04,296 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:57:04,296 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:57:04,297 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:57:04,297 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:57:04,297 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:57:04,297 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:57:04,298 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:57:04,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:57:04,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:57:04,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:57:04,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:57:04,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:57:04,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:57:04,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:57:04,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:57:04,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:57:04,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:57:04,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:57:04,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:57:04,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:57:04,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:57:04,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:57:04,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:57:04,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:57:04,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:57:04,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:57:04,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:57:04,305 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:57:04,305 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:57:04,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:57:04,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:57:04,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:57:04,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:57:04,380 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:57:04,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-10-27 00:57:04,439 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/51961d639/e5845763bd6f4efcbcda3d90595d5b16/FLAG93e799b05 [2018-10-27 00:57:05,073 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:57:05,074 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-10-27 00:57:05,089 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/51961d639/e5845763bd6f4efcbcda3d90595d5b16/FLAG93e799b05 [2018-10-27 00:57:05,114 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/51961d639/e5845763bd6f4efcbcda3d90595d5b16 [2018-10-27 00:57:05,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:57:05,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:57:05,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:57:05,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:57:05,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:57:05,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:05,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6f7036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05, skipping insertion in model container [2018-10-27 00:57:05,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:05,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:57:05,246 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:57:05,673 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:57:05,679 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:57:05,815 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:57:05,842 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:57:05,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05 WrapperNode [2018-10-27 00:57:05,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:57:05,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:57:05,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:57:05,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:57:05,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:05,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:57:06,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:57:06,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:57:06,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:57:06,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (1/1) ... [2018-10-27 00:57:06,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:57:06,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:57:06,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:57:06,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:57:06,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (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-27 00:57:06,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:57:06,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:57:06,238 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:57:06,239 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:57:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:57:06,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:57:06,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:57:06,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:57:09,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:57:09,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:57:09 BoogieIcfgContainer [2018-10-27 00:57:09,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:57:09,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:57:09,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:57:09,703 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:57:09,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:57:05" (1/3) ... [2018-10-27 00:57:09,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4559d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:57:09, skipping insertion in model container [2018-10-27 00:57:09,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:57:05" (2/3) ... [2018-10-27 00:57:09,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4559d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:57:09, skipping insertion in model container [2018-10-27 00:57:09,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:57:09" (3/3) ... [2018-10-27 00:57:09,713 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-10-27 00:57:09,725 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:57:09,741 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:57:09,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:57:09,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:57:09,817 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:57:09,817 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:57:09,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:57:09,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:57:09,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:57:09,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:57:09,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:57:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 00:57:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:57:09,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:09,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:57:09,877 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:09,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1195562327, now seen corresponding path program 1 times [2018-10-27 00:57:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:09,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:09,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:09,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:10,476 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:57:10,591 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-27 00:57:10,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:10,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:57:10,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:10,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:57:10,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:57:10,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:57:10,625 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 00:57:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:12,463 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 00:57:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:57:12,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-27 00:57:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:12,491 INFO L225 Difference]: With dead ends: 621 [2018-10-27 00:57:12,491 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 00:57:12,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:57:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 00:57:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 00:57:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 00:57:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 00:57:12,592 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 117 [2018-10-27 00:57:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:12,593 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 00:57:12,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:57:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 00:57:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:57:12,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:12,602 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:12,603 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:12,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -324277142, now seen corresponding path program 1 times [2018-10-27 00:57:12,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:12,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:13,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:13,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:13,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:13,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:13,005 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 00:57:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:14,620 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 00:57:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:57:14,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-10-27 00:57:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:14,627 INFO L225 Difference]: With dead ends: 903 [2018-10-27 00:57:14,627 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 00:57:14,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 00:57:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 00:57:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 00:57:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 00:57:14,657 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 126 [2018-10-27 00:57:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:14,658 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 00:57:14,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 00:57:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:57:14,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:14,663 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:14,663 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:14,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1188045302, now seen corresponding path program 1 times [2018-10-27 00:57:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:14,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:15,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:15,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:15,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:15,085 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 00:57:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:16,970 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 00:57:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:57:16,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-27 00:57:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:16,978 INFO L225 Difference]: With dead ends: 901 [2018-10-27 00:57:16,978 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 00:57:16,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 00:57:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 00:57:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 00:57:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 00:57:17,003 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 132 [2018-10-27 00:57:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:17,004 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 00:57:17,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 00:57:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:57:17,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:17,007 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:17,007 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -34077619, now seen corresponding path program 1 times [2018-10-27 00:57:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:17,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:17,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:17,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:57:17,198 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:17,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:57:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:57:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:57:17,200 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 00:57:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:20,560 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 00:57:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:57:20,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-27 00:57:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:20,566 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 00:57:20,566 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 00:57:20,568 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-27 00:57:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 00:57:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 00:57:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 00:57:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 00:57:20,605 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 140 [2018-10-27 00:57:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:20,606 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 00:57:20,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:57:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 00:57:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 00:57:20,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:20,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:57:20,610 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:20,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1593443119, now seen corresponding path program 1 times [2018-10-27 00:57:20,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:20,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:20,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:20,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:20,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:20,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:20,944 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 00:57:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:22,077 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 00:57:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:57:22,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-27 00:57:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:22,087 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 00:57:22,087 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 00:57:22,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 00:57:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 00:57:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 00:57:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 00:57:22,124 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 142 [2018-10-27 00:57:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:22,125 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 00:57:22,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 00:57:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:57:22,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:22,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:57:22,129 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:22,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash 890086741, now seen corresponding path program 1 times [2018-10-27 00:57:22,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:22,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:22,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:22,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:22,438 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:22,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:22,440 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 00:57:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:23,901 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 00:57:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:57:23,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-27 00:57:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:23,910 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 00:57:23,910 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 00:57:23,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 00:57:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 00:57:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 00:57:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 00:57:23,954 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 144 [2018-10-27 00:57:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:23,955 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 00:57:23,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 00:57:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:57:23,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:23,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 00:57:23,960 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:23,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 207226461, now seen corresponding path program 1 times [2018-10-27 00:57:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:23,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:23,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:24,196 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:57:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:24,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:24,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:57:24,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:24,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:57:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:57:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:57:24,325 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 00:57:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:25,450 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 00:57:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:57:25,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-27 00:57:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:25,463 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 00:57:25,463 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 00:57:25,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:57:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 00:57:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 00:57:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 00:57:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 00:57:25,515 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 148 [2018-10-27 00:57:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:25,516 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 00:57:25,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:57:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 00:57:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:57:25,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:25,523 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, 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] [2018-10-27 00:57:25,523 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:25,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1224274575, now seen corresponding path program 1 times [2018-10-27 00:57:25,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:25,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:25,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:25,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:57:25,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:57:25,733 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-10-27 00:57:25,736 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 00:57:25,813 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:57:25,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:57:56,388 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:57:56,390 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 00:57:56,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:56,403 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:58:03,434 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 82.33% of their original sizes. [2018-10-27 00:58:03,435 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:59:46,539 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-10-27 00:59:46,540 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:59:46,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:59:46,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-10-27 00:59:46,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:46,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 00:59:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 00:59:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-10-27 00:59:46,543 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 26 states. Received shutdown request... [2018-10-27 01:01:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 01:01:19,009 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 01:01:19,016 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 01:01:19,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:01:19 BoogieIcfgContainer [2018-10-27 01:01:19,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:01:19,018 INFO L168 Benchmark]: Toolchain (without parser) took 253888.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 613.5 MB. Max. memory is 7.1 GB. [2018-10-27 01:01:19,020 INFO L168 Benchmark]: CDTParser took 0.21 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-27 01:01:19,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 01:01:19,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 227.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 01:01:19,022 INFO L168 Benchmark]: Boogie Preprocessor took 71.93 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 01:01:19,022 INFO L168 Benchmark]: RCFGBuilder took 3542.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2018-10-27 01:01:19,023 INFO L168 Benchmark]: TraceAbstraction took 249323.72 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 538.2 MB. Max. memory is 7.1 GB. [2018-10-27 01:01:19,029 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.21 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 707.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 227.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.93 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3542.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249323.72 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 538.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 502]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 502). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 22 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (380 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 249.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 105.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 894 SDtfs, 4361 SDslu, 730 SDs, 0 SdLazy, 5558 SolverSat, 1111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 245 GetRequests, 163 SyntacticMatches, 23 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 109.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9949119159645479 AbsIntWeakeningRatio, 0.1813186813186813 AbsIntAvgWeakeningVarsNumRemoved, 490.6208791208791 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown