java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem13_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 03:21:40,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 03:21:40,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 03:21:40,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 03:21:40,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 03:21:40,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 03:21:40,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 03:21:40,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 03:21:40,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 03:21:40,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 03:21:40,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 03:21:40,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 03:21:40,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 03:21:40,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 03:21:40,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 03:21:40,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 03:21:40,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 03:21:40,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 03:21:40,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 03:21:40,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 03:21:40,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 03:21:40,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 03:21:40,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 03:21:40,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 03:21:40,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 03:21:40,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 03:21:40,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 03:21:40,576 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 03:21:40,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 03:21:40,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 03:21:40,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 03:21:40,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 03:21:40,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 03:21:40,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 03:21:40,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 03:21:40,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 03:21:40,586 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 03:21:40,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 03:21:40,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 03:21:40,624 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 03:21:40,624 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 03:21:40,624 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 03:21:40,625 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 03:21:40,625 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 03:21:40,625 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 03:21:40,625 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 03:21:40,626 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 03:21:40,626 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 03:21:40,626 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 03:21:40,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 03:21:40,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 03:21:40,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 03:21:40,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 03:21:40,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 03:21:40,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 03:21:40,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 03:21:40,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 03:21:40,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 03:21:40,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 03:21:40,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 03:21:40,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 03:21:40,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 03:21:40,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 03:21:40,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 03:21:40,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 03:21:40,632 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 03:21:40,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 03:21:40,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 03:21:40,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 03:21:40,632 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 03:21:40,633 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 03:21:40,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 03:21:40,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 03:21:40,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 03:21:40,733 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 03:21:40,733 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 03:21:40,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-07 03:21:40,807 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a302bc9/0e9b222839f642aead35f372a951ff0b/FLAGbe1b2ee6b [2018-11-07 03:21:41,616 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 03:21:41,617 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label52_true-unreach-call.c [2018-11-07 03:21:41,665 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a302bc9/0e9b222839f642aead35f372a951ff0b/FLAGbe1b2ee6b [2018-11-07 03:21:41,684 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a302bc9/0e9b222839f642aead35f372a951ff0b [2018-11-07 03:21:41,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 03:21:41,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 03:21:41,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 03:21:41,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 03:21:41,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 03:21:41,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:21:41" (1/1) ... [2018-11-07 03:21:41,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719de5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:41, skipping insertion in model container [2018-11-07 03:21:41,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:21:41" (1/1) ... [2018-11-07 03:21:41,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 03:21:41,938 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 03:21:43,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:21:43,592 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 03:21:44,324 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:21:44,361 INFO L193 MainTranslator]: Completed translation [2018-11-07 03:21:44,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44 WrapperNode [2018-11-07 03:21:44,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 03:21:44,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 03:21:44,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 03:21:44,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 03:21:44,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 03:21:44,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 03:21:44,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 03:21:44,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 03:21:44,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:44,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:45,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:45,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... [2018-11-07 03:21:45,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 03:21:45,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 03:21:45,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 03:21:45,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 03:21:45,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 03:21:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 03:21:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 03:21:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 03:21:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 03:21:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 03:21:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 03:21:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 03:21:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 03:21:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 03:21:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 03:21:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 03:21:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 03:21:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 03:21:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 03:21:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 03:21:56,176 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 03:21:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:21:56 BoogieIcfgContainer [2018-11-07 03:21:56,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 03:21:56,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 03:21:56,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 03:21:56,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 03:21:56,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:21:41" (1/3) ... [2018-11-07 03:21:56,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef70da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:21:56, skipping insertion in model container [2018-11-07 03:21:56,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:21:44" (2/3) ... [2018-11-07 03:21:56,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef70da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:21:56, skipping insertion in model container [2018-11-07 03:21:56,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:21:56" (3/3) ... [2018-11-07 03:21:56,185 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label52_true-unreach-call.c [2018-11-07 03:21:56,196 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 03:21:56,208 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 03:21:56,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 03:21:56,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 03:21:56,277 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 03:21:56,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 03:21:56,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 03:21:56,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 03:21:56,278 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 03:21:56,278 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 03:21:56,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 03:21:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 03:21:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 03:21:56,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:21:56,338 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] [2018-11-07 03:21:56,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:21:56,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:21:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -774157709, now seen corresponding path program 1 times [2018-11-07 03:21:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:21:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:21:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:21:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:21:56,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:21:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:21:56,882 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:21:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:21:56,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:21:56,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 03:21:56,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:21:56,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 03:21:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 03:21:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 03:21:57,009 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-11-07 03:22:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:22:05,483 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-11-07 03:22:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:22:05,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-07 03:22:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:22:05,521 INFO L225 Difference]: With dead ends: 3093 [2018-11-07 03:22:05,521 INFO L226 Difference]: Without dead ends: 1971 [2018-11-07 03:22:05,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 03:22:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-11-07 03:22:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-11-07 03:22:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-11-07 03:22:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-11-07 03:22:05,695 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 71 [2018-11-07 03:22:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:22:05,696 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-11-07 03:22:05,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 03:22:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-11-07 03:22:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 03:22:05,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:22:05,706 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 03:22:05,707 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:22:05,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:22:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1438454356, now seen corresponding path program 1 times [2018-11-07 03:22:05,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:22:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:22:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:05,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:22:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:22:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:22:06,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:22:06,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:22:06,350 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:22:06,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:22:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:22:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:22:06,355 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-11-07 03:22:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:22:22,779 INFO L93 Difference]: Finished difference Result 5630 states and 10205 transitions. [2018-11-07 03:22:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:22:22,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-11-07 03:22:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:22:22,806 INFO L225 Difference]: With dead ends: 5630 [2018-11-07 03:22:22,807 INFO L226 Difference]: Without dead ends: 3679 [2018-11-07 03:22:22,817 INFO L604 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-11-07 03:22:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2018-11-07 03:22:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3636. [2018-11-07 03:22:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-11-07 03:22:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5828 transitions. [2018-11-07 03:22:22,917 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5828 transitions. Word has length 154 [2018-11-07 03:22:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:22:22,918 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 5828 transitions. [2018-11-07 03:22:22,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:22:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5828 transitions. [2018-11-07 03:22:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 03:22:22,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:22:22,922 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 03:22:22,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:22:22,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:22:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1449223166, now seen corresponding path program 1 times [2018-11-07 03:22:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:22:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:22:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:22,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:22:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:22:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:22:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:22:23,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:22:23,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:22:23,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:22:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:22:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:22:23,134 INFO L87 Difference]: Start difference. First operand 3636 states and 5828 transitions. Second operand 5 states. [2018-11-07 03:22:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:22:39,125 INFO L93 Difference]: Finished difference Result 13450 states and 21898 transitions. [2018-11-07 03:22:39,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:22:39,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-11-07 03:22:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:22:39,179 INFO L225 Difference]: With dead ends: 13450 [2018-11-07 03:22:39,179 INFO L226 Difference]: Without dead ends: 9820 [2018-11-07 03:22:39,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:22:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2018-11-07 03:22:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9623. [2018-11-07 03:22:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9623 states. [2018-11-07 03:22:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 14633 transitions. [2018-11-07 03:22:39,469 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 14633 transitions. Word has length 161 [2018-11-07 03:22:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:22:39,470 INFO L480 AbstractCegarLoop]: Abstraction has 9623 states and 14633 transitions. [2018-11-07 03:22:39,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:22:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 14633 transitions. [2018-11-07 03:22:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 03:22:39,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:22:39,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 03:22:39,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:22:39,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:22:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2036148572, now seen corresponding path program 1 times [2018-11-07 03:22:39,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:22:39,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:22:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:39,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:22:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:22:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:22:39,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:22:39,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:22:39,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:22:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:22:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:22:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:22:39,797 INFO L87 Difference]: Start difference. First operand 9623 states and 14633 transitions. Second operand 5 states. [2018-11-07 03:22:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:22:49,903 INFO L93 Difference]: Finished difference Result 28946 states and 45937 transitions. [2018-11-07 03:22:49,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:22:49,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-11-07 03:22:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:22:50,022 INFO L225 Difference]: With dead ends: 28946 [2018-11-07 03:22:50,022 INFO L226 Difference]: Without dead ends: 19329 [2018-11-07 03:22:50,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:22:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19329 states. [2018-11-07 03:22:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19329 to 18999. [2018-11-07 03:22:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2018-11-07 03:22:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 27487 transitions. [2018-11-07 03:22:50,529 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 27487 transitions. Word has length 170 [2018-11-07 03:22:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:22:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 18999 states and 27487 transitions. [2018-11-07 03:22:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:22:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 27487 transitions. [2018-11-07 03:22:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 03:22:50,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:22:50,540 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:22:50,540 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:22:50,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:22:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1111253638, now seen corresponding path program 1 times [2018-11-07 03:22:50,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:22:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:50,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:22:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:22:50,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:22:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:22:50,805 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:22:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:22:51,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:22:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:22:51,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:22:51,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:22:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:22:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:22:51,131 INFO L87 Difference]: Start difference. First operand 18999 states and 27487 transitions. Second operand 6 states. [2018-11-07 03:23:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:23:03,332 INFO L93 Difference]: Finished difference Result 58216 states and 91373 transitions. [2018-11-07 03:23:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:23:03,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-07 03:23:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:23:03,516 INFO L225 Difference]: With dead ends: 58216 [2018-11-07 03:23:03,516 INFO L226 Difference]: Without dead ends: 39223 [2018-11-07 03:23:03,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 03:23:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39223 states. [2018-11-07 03:23:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39223 to 39047. [2018-11-07 03:23:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39047 states. [2018-11-07 03:23:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39047 states to 39047 states and 54715 transitions. [2018-11-07 03:23:04,549 INFO L78 Accepts]: Start accepts. Automaton has 39047 states and 54715 transitions. Word has length 181 [2018-11-07 03:23:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:23:04,550 INFO L480 AbstractCegarLoop]: Abstraction has 39047 states and 54715 transitions. [2018-11-07 03:23:04,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:23:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 39047 states and 54715 transitions. [2018-11-07 03:23:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 03:23:04,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:23:04,561 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 03:23:04,561 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:23:04,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:23:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -747971991, now seen corresponding path program 1 times [2018-11-07 03:23:04,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:23:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:04,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:23:04,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:04,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:23:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:23:04,819 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:23:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:23:05,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:23:05,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:23:05,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:23:05,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:23:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:23:05,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:23:05,214 INFO L87 Difference]: Start difference. First operand 39047 states and 54715 transitions. Second operand 6 states. [2018-11-07 03:23:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:23:14,087 INFO L93 Difference]: Finished difference Result 98710 states and 156662 transitions. [2018-11-07 03:23:14,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:23:14,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-11-07 03:23:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:23:14,348 INFO L225 Difference]: With dead ends: 98710 [2018-11-07 03:23:14,348 INFO L226 Difference]: Without dead ends: 59669 [2018-11-07 03:23:14,450 INFO L604 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-11-07 03:23:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59669 states. [2018-11-07 03:23:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59669 to 59442. [2018-11-07 03:23:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59442 states. [2018-11-07 03:23:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59442 states to 59442 states and 85231 transitions. [2018-11-07 03:23:15,812 INFO L78 Accepts]: Start accepts. Automaton has 59442 states and 85231 transitions. Word has length 190 [2018-11-07 03:23:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:23:15,812 INFO L480 AbstractCegarLoop]: Abstraction has 59442 states and 85231 transitions. [2018-11-07 03:23:15,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:23:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 59442 states and 85231 transitions. [2018-11-07 03:23:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-07 03:23:15,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:23:15,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-07 03:23:15,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:23:15,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:23:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1403677423, now seen corresponding path program 1 times [2018-11-07 03:23:15,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:23:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:15,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:23:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:15,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:23:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:23:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:23:16,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:23:16,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:23:16,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:23:16,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:23:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:23:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:23:16,211 INFO L87 Difference]: Start difference. First operand 59442 states and 85231 transitions. Second operand 6 states. [2018-11-07 03:23:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:23:24,224 INFO L93 Difference]: Finished difference Result 124489 states and 183187 transitions. [2018-11-07 03:23:24,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:23:24,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-07 03:23:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:23:24,462 INFO L225 Difference]: With dead ends: 124489 [2018-11-07 03:23:24,463 INFO L226 Difference]: Without dead ends: 65053 [2018-11-07 03:23:24,614 INFO L604 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-11-07 03:23:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65053 states. [2018-11-07 03:23:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65053 to 64927. [2018-11-07 03:23:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64927 states. [2018-11-07 03:23:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64927 states to 64927 states and 87972 transitions. [2018-11-07 03:23:26,849 INFO L78 Accepts]: Start accepts. Automaton has 64927 states and 87972 transitions. Word has length 265 [2018-11-07 03:23:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:23:26,850 INFO L480 AbstractCegarLoop]: Abstraction has 64927 states and 87972 transitions. [2018-11-07 03:23:26,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:23:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64927 states and 87972 transitions. [2018-11-07 03:23:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 03:23:26,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:23:26,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:23:26,884 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:23:26,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:23:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2001119171, now seen corresponding path program 1 times [2018-11-07 03:23:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:23:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:26,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:23:26,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:26,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:23:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:23:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:23:27,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:23:27,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:23:27,331 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:23:27,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:23:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:23:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:23:27,333 INFO L87 Difference]: Start difference. First operand 64927 states and 87972 transitions. Second operand 5 states. [2018-11-07 03:23:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:23:42,017 INFO L93 Difference]: Finished difference Result 165884 states and 236667 transitions. [2018-11-07 03:23:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:23:42,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2018-11-07 03:23:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:23:43,243 INFO L225 Difference]: With dead ends: 165884 [2018-11-07 03:23:43,243 INFO L226 Difference]: Without dead ends: 100963 [2018-11-07 03:23:43,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:23:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100963 states. [2018-11-07 03:23:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100963 to 100796. [2018-11-07 03:23:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100796 states. [2018-11-07 03:23:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100796 states to 100796 states and 143272 transitions. [2018-11-07 03:23:44,976 INFO L78 Accepts]: Start accepts. Automaton has 100796 states and 143272 transitions. Word has length 271 [2018-11-07 03:23:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:23:44,977 INFO L480 AbstractCegarLoop]: Abstraction has 100796 states and 143272 transitions. [2018-11-07 03:23:44,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:23:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 100796 states and 143272 transitions. [2018-11-07 03:23:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-07 03:23:45,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:23:45,006 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 03:23:45,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:23:45,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:23:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -227591905, now seen corresponding path program 1 times [2018-11-07 03:23:45,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:23:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:45,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:23:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:23:45,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:23:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:23:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 205 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:23:45,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:23:45,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:23:45,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-07 03:23:45,582 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3067], [3075], [3083], [3091], [3095], [3097], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3221], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 03:23:45,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:23:45,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:23:53,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:23:53,970 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 03:23:53,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:23:53,984 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:23:58,918 INFO L227 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 71.88% of their original sizes. [2018-11-07 03:23:58,918 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:24:00,542 INFO L415 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-11-07 03:24:00,543 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:24:00,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:24:00,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-11-07 03:24:00,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:24:00,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 03:24:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 03:24:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 03:24:00,546 INFO L87 Difference]: Start difference. First operand 100796 states and 143272 transitions. Second operand 11 states. [2018-11-07 03:24:30,071 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 03:25:08,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 03:25:08,745 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 03:25:08,751 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 03:25:08,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:25:08 BoogieIcfgContainer [2018-11-07 03:25:08,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 03:25:08,752 INFO L168 Benchmark]: Toolchain (without parser) took 207052.76 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 903.9 MB in the end (delta: 477.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,753 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 03:25:08,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2660.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 418.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,761 INFO L168 Benchmark]: Boogie Preprocessor took 310.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,761 INFO L168 Benchmark]: RCFGBuilder took 11084.09 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 195.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -28.7 MB). Peak memory consumption was 675.5 MB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,762 INFO L168 Benchmark]: TraceAbstraction took 192573.04 ms. Allocated memory was 2.5 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 903.9 MB in the end (delta: 1.3 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 03:25:08,768 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2660.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 418.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 310.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11084.09 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 195.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -28.7 MB). Peak memory consumption was 675.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192573.04 ms. Allocated memory was 2.5 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 903.9 MB in the end (delta: 1.3 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 204]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 204). Cancelled while BasicCegarLoop was constructing difference of abstraction (100796states) and FLOYD_HOARE automaton (currently 10 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (664 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 192.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 165.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3315 SDtfs, 29308 SDslu, 4088 SDs, 0 SdLazy, 49696 SolverSat, 10861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 122.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 358 GetRequests, 292 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100796occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9966931289351215 AbsIntWeakeningRatio, 0.10676156583629894 AbsIntAvgWeakeningVarsNumRemoved, 21.871886120996443 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1280 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1745 NumberOfCodeBlocks, 1745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 653/666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown