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_label48_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:55:41,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:55:41,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:55:41,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:55:41,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:55:41,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:55:41,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:55:41,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:55:41,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:55:41,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:55:41,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:55:41,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:55:41,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:55:41,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:55:41,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:55:41,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:55:41,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:55:41,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:55:41,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:55:41,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:55:41,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:55:41,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:55:41,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:55:41,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:55:41,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:55:41,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:55:41,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:55:41,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:55:41,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:55:41,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:55:41,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:55:41,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:55:41,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:55:41,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:55:41,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:55:41,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:55:41,608 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:55:41,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:55:41,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:55:41,629 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:55:41,630 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:55:41,630 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:55:41,630 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:55:41,630 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:55:41,631 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:55:41,631 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:55:41,631 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:55:41,631 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:55:41,631 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:55:41,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:55:41,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:55:41,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:55:41,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:55:41,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:55:41,634 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:55:41,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:55:41,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:55:41,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:55:41,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:55:41,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:55:41,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:55:41,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:55:41,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:55:41,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:55:41,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:55:41,638 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:55:41,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:55:41,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:55:41,639 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:55:41,639 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:55:41,639 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:55:41,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:55:41,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:55:41,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:55:41,735 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:55:41,735 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:55:41,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-10-27 00:55:41,809 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ed78bbec/6c5c913257c44dc9a83ab440f7ea2d0d/FLAGbc53ce4aa [2018-10-27 00:55:42,411 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:55:42,412 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-10-27 00:55:42,426 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ed78bbec/6c5c913257c44dc9a83ab440f7ea2d0d/FLAGbc53ce4aa [2018-10-27 00:55:42,447 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7ed78bbec/6c5c913257c44dc9a83ab440f7ea2d0d [2018-10-27 00:55:42,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:55:42,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:55:42,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:42,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:55:42,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:55:42,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:42" (1/1) ... [2018-10-27 00:55:42,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:42, skipping insertion in model container [2018-10-27 00:55:42,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:42" (1/1) ... [2018-10-27 00:55:42,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:55:42,536 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:55:43,053 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:43,059 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:55:43,210 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:43,227 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:55:43,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43 WrapperNode [2018-10-27 00:55:43,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:43,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:43,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:55:43,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:55:43,238 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:55:43" (1/1) ... [2018-10-27 00:55:43,258 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:55:43" (1/1) ... [2018-10-27 00:55:43,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:43,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:55:43,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:55:43,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:55:43,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (1/1) ... [2018-10-27 00:55:43,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:55:43,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:55:43,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:55:43,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:55:43,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (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:55:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:55:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:55:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:55:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:55:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:55:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:55:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:55:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:55:46,811 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:55:46,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:46 BoogieIcfgContainer [2018-10-27 00:55:46,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:55:46,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:55:46,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:55:46,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:55:46,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:55:42" (1/3) ... [2018-10-27 00:55:46,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:46, skipping insertion in model container [2018-10-27 00:55:46,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:43" (2/3) ... [2018-10-27 00:55:46,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:46, skipping insertion in model container [2018-10-27 00:55:46,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:46" (3/3) ... [2018-10-27 00:55:46,825 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label48_true-unreach-call_false-termination.c [2018-10-27 00:55:46,838 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:55:46,851 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:55:46,869 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:55:46,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:55:46,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:55:46,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:55:46,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:55:46,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:55:46,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:55:46,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:55:46,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:55:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 00:55:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:55:46,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:46,961 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, 1, 1, 1, 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:55:46,964 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:46,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash -549296008, now seen corresponding path program 1 times [2018-10-27 00:55:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:47,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:47,683 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:55:47,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:47,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:47,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:47,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:47,714 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 00:55:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:49,240 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 00:55:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:49,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-27 00:55:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:49,262 INFO L225 Difference]: With dead ends: 621 [2018-10-27 00:55:49,262 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 00:55:49,269 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:55:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 00:55:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 00:55:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 00:55:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 00:55:49,348 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 144 [2018-10-27 00:55:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:49,349 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 00:55:49,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 00:55:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 00:55:49,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:49,362 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, 1, 1, 1, 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:55:49,362 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:49,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash -949584507, now seen corresponding path program 1 times [2018-10-27 00:55:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:49,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:49,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:49,962 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 00:55:50,174 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:55:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:50,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:55:50,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:50,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:55:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:55:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:50,179 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 00:55:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:51,623 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 00:55:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:55:51,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-10-27 00:55:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:51,628 INFO L225 Difference]: With dead ends: 903 [2018-10-27 00:55:51,629 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 00:55:51,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 00:55:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 00:55:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 00:55:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 00:55:51,676 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 153 [2018-10-27 00:55:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:51,676 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 00:55:51,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:55:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 00:55:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 00:55:51,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:51,689 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, 1, 1, 1, 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:55:51,689 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:51,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 798568569, now seen corresponding path program 1 times [2018-10-27 00:55:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:51,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:51,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:52,207 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-27 00:55:52,377 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:55:52,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:55:52,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:52,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:55:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:55:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:52,379 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 00:55:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:54,028 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 00:55:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:55:54,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-10-27 00:55:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:54,036 INFO L225 Difference]: With dead ends: 901 [2018-10-27 00:55:54,036 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 00:55:54,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 00:55:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 00:55:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 00:55:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 00:55:54,076 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 159 [2018-10-27 00:55:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:54,077 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 00:55:54,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:55:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 00:55:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-27 00:55:54,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:54,083 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, 1, 1, 1, 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:55:54,083 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:54,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1751281726, now seen corresponding path program 1 times [2018-10-27 00:55:54,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:54,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:54,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:54,325 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:55:54,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:54,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:55:54,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:54,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:55:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:55:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:55:54,327 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 00:55:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:57,313 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 00:55:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:55:57,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-27 00:55:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:57,320 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 00:55:57,320 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 00:55:57,322 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:55:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 00:55:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 00:55:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 00:55:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 00:55:57,357 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 167 [2018-10-27 00:55:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:57,357 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 00:55:57,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:55:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 00:55:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-27 00:55:57,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:57,362 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, 1, 1, 1, 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:55:57,363 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:57,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash 526148798, now seen corresponding path program 1 times [2018-10-27 00:55:57,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:57,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:57,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:57,781 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 00:55:58,036 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 00:55:58,106 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:55:58,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:58,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:55:58,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:58,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:55:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:55:58,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:58,108 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 00:55:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:59,229 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 00:55:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:55:59,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-10-27 00:55:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:59,251 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 00:55:59,252 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 00:55:59,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 00:55:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 00:55:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 00:55:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 00:55:59,290 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 169 [2018-10-27 00:55:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:59,291 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 00:55:59,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:55:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 00:55:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:55:59,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:59,295 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, 1, 1, 1, 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:55:59,296 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:59,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1751938630, now seen corresponding path program 1 times [2018-10-27 00:55:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:59,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:59,626 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:55:59,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:55:59,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:59,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:55:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:55:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:59,628 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 00:56:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:01,280 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 00:56:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:56:01,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2018-10-27 00:56:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:01,286 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 00:56:01,286 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 00:56:01,290 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:56:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 00:56:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 00:56:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 00:56:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 00:56:01,315 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 171 [2018-10-27 00:56:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:01,315 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 00:56:01,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:56:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 00:56:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-27 00:56:01,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:01,320 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, 1, 1, 1, 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:56:01,321 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:01,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1260045234, now seen corresponding path program 1 times [2018-10-27 00:56:01,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:01,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:01,551 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:56:01,929 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:56:01,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:01,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:56:01,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:01,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:56:01,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:56:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:56:01,931 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 00:56:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:03,505 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 00:56:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:56:03,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-10-27 00:56:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:03,517 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 00:56:03,517 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 00:56:03,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:56:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 00:56:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 00:56:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 00:56:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 00:56:03,570 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 175 [2018-10-27 00:56:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:03,571 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 00:56:03,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:56:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 00:56:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-27 00:56:03,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:03,578 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:56:03,578 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:03,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1346398007, now seen corresponding path program 1 times [2018-10-27 00:56:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:03,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:03,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:56:03,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:56:03,856 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-10-27 00:56:03,859 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [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], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 00:56:03,931 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:56:03,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:57:09,280 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:57:09,281 INFO L272 AbstractInterpreter]: Visited 148 different actions 440 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 00:57:09,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:09,295 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:57:15,881 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 88.89% of their original sizes. [2018-10-27 00:57:15,882 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-10-27 01:00:06,934 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 01:00:06,939 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 01:00:06,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:00:06 BoogieIcfgContainer [2018-10-27 01:00:06,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:00:06,941 INFO L168 Benchmark]: Toolchain (without parser) took 264482.00 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 385.5 MB. Max. memory is 7.1 GB. [2018-10-27 01:00:06,942 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 01:00:06,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.04 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-10-27 01:00:06,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-27 01:00:06,945 INFO L168 Benchmark]: Boogie Preprocessor took 87.16 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:00:06,945 INFO L168 Benchmark]: RCFGBuilder took 3318.09 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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2018-10-27 01:00:06,946 INFO L168 Benchmark]: TraceAbstraction took 260126.84 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 309.1 MB. Max. memory is 7.1 GB. [2018-10-27 01:00:06,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.04 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 177.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.16 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 3318.09 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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260126.84 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 309.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 182 with TraceHistMax 3,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 260.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 3978 SDslu, 687 SDs, 0 SdLazy, 5049 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.4s 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, 65.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9948553816974874 AbsIntWeakeningRatio, 0.18333333333333332 AbsIntAvgWeakeningVarsNumRemoved, 1227.4333333333334 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, 3.1s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1341290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown