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-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:27:51,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:27:51,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:27:51,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:27:51,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:27:51,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:27:51,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:27:51,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:27:51,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:27:51,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:27:51,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:27:51,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:27:51,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:27:51,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:27:51,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:27:51,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:27:51,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:27:51,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:27:51,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:27:51,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:27:51,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:27:51,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:27:51,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:27:51,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:27:51,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:27:51,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:27:51,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:27:51,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:27:51,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:27:51,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:27:51,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:27:51,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:27:51,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:27:51,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:27:51,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:27:51,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:27:51,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:27:51,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:27:51,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:27:51,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:27:51,717 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:27:51,717 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:27:51,720 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:27:51,720 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:27:51,720 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:27:51,721 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:27:51,723 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:27:51,723 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:27:51,723 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:27:51,723 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:27:51,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:27:51,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:27:51,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:27:51,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:27:51,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:27:51,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:27:51,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:27:51,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:27:51,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:27:51,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:27:51,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:27:51,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:27:51,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:27:51,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:27:51,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:27:51,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:27:51,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:27:51,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:27:51,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:27:51,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:27:51,730 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:27:51,731 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:27:51,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:27:51,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:27:51,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:27:51,801 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:27:51,801 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:27:51,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-11-07 20:27:51,883 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d21b2bc1/c9be4eea8e4d4f61a7cb092c253e23c4/FLAG3c6f88a83 [2018-11-07 20:27:52,782 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:27:52,783 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-11-07 20:27:52,832 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d21b2bc1/c9be4eea8e4d4f61a7cb092c253e23c4/FLAG3c6f88a83 [2018-11-07 20:27:52,850 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d21b2bc1/c9be4eea8e4d4f61a7cb092c253e23c4 [2018-11-07 20:27:52,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:27:52,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:27:52,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:27:52,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:27:52,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:27:52,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:52" (1/1) ... [2018-11-07 20:27:52,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54967387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:52, skipping insertion in model container [2018-11-07 20:27:52,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:52" (1/1) ... [2018-11-07 20:27:52,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:27:53,080 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:27:54,668 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:27:54,673 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:27:55,454 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:27:55,492 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:27:55,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55 WrapperNode [2018-11-07 20:27:55,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:27:55,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:27:55,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:27:55,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:27:55,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:55,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:55,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:27:55,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:27:55,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:27:55,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:27:55,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:55,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:55,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:55,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:56,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:56,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:56,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (1/1) ... [2018-11-07 20:27:56,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:27:56,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:27:56,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:27:56,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:27:56,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (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 20:27:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:27:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:27:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:27:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:27:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:27:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:27:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:27:56,265 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:27:56,265 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:27:56,265 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:27:56,265 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:27:56,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:27:56,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:27:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:27:56,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:28:05,330 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:28:05,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:05 BoogieIcfgContainer [2018-11-07 20:28:05,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:28:05,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:28:05,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:28:05,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:28:05,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:27:52" (1/3) ... [2018-11-07 20:28:05,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511f1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:05, skipping insertion in model container [2018-11-07 20:28:05,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:55" (2/3) ... [2018-11-07 20:28:05,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511f1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:28:05, skipping insertion in model container [2018-11-07 20:28:05,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:28:05" (3/3) ... [2018-11-07 20:28:05,339 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label26_true-unreach-call.c [2018-11-07 20:28:05,349 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:28:05,368 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:28:05,386 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:28:05,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:28:05,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:28:05,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:28:05,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:28:05,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:28:05,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:28:05,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:28:05,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:28:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 20:28:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 20:28:05,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:05,509 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] [2018-11-07 20:28:05,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:05,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1543659883, now seen corresponding path program 1 times [2018-11-07 20:28:05,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:05,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:05,978 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-07 20:28:05,996 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 20:28:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:05,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:28:05,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:06,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:28:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:28:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:06,029 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-11-07 20:28:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:18,273 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-11-07 20:28:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:28:18,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-07 20:28:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:18,320 INFO L225 Difference]: With dead ends: 3968 [2018-11-07 20:28:18,321 INFO L226 Difference]: Without dead ends: 2842 [2018-11-07 20:28:18,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-11-07 20:28:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-11-07 20:28:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-11-07 20:28:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-11-07 20:28:18,516 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 45 [2018-11-07 20:28:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:18,517 INFO L480 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-11-07 20:28:18,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:28:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-11-07 20:28:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 20:28:18,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:18,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:18,529 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:18,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 369865390, now seen corresponding path program 1 times [2018-11-07 20:28:18,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:18,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:18,886 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:28:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:18,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:18,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:28:18,997 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:18,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:28:19,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:28:19,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:28:19,000 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-11-07 20:28:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:30,468 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-11-07 20:28:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:28:30,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-11-07 20:28:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:30,501 INFO L225 Difference]: With dead ends: 5673 [2018-11-07 20:28:30,501 INFO L226 Difference]: Without dead ends: 3698 [2018-11-07 20:28:30,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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 20:28:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-11-07 20:28:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-11-07 20:28:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-11-07 20:28:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-11-07 20:28:30,629 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 115 [2018-11-07 20:28:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:30,630 INFO L480 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-11-07 20:28:30,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:28:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-11-07 20:28:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 20:28:30,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:30,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:30,643 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:30,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash 241566930, now seen corresponding path program 1 times [2018-11-07 20:28:30,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:30,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:30,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:30,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:28:30,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:28:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:28:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:28:30,875 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-11-07 20:28:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:39,652 INFO L93 Difference]: Finished difference Result 10955 states and 17866 transitions. [2018-11-07 20:28:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:28:39,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-11-07 20:28:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:39,689 INFO L225 Difference]: With dead ends: 10955 [2018-11-07 20:28:39,689 INFO L226 Difference]: Without dead ends: 7274 [2018-11-07 20:28:39,701 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 20:28:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7274 states. [2018-11-07 20:28:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7274 to 7167. [2018-11-07 20:28:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7167 states. [2018-11-07 20:28:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7167 states to 7167 states and 10519 transitions. [2018-11-07 20:28:39,918 INFO L78 Accepts]: Start accepts. Automaton has 7167 states and 10519 transitions. Word has length 117 [2018-11-07 20:28:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:39,919 INFO L480 AbstractCegarLoop]: Abstraction has 7167 states and 10519 transitions. [2018-11-07 20:28:39,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:28:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7167 states and 10519 transitions. [2018-11-07 20:28:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 20:28:39,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:39,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:39,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:39,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash 572519882, now seen corresponding path program 1 times [2018-11-07 20:28:39,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:39,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:39,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:40,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:40,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:28:40,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:40,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:28:40,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:28:40,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:40,173 INFO L87 Difference]: Start difference. First operand 7167 states and 10519 transitions. Second operand 4 states. [2018-11-07 20:28:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:48,971 INFO L93 Difference]: Finished difference Result 27645 states and 43286 transitions. [2018-11-07 20:28:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:28:48,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-07 20:28:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:49,062 INFO L225 Difference]: With dead ends: 27645 [2018-11-07 20:28:49,062 INFO L226 Difference]: Without dead ends: 20484 [2018-11-07 20:28:49,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20484 states. [2018-11-07 20:28:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20484 to 20445. [2018-11-07 20:28:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20445 states. [2018-11-07 20:28:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20445 states to 20445 states and 29105 transitions. [2018-11-07 20:28:49,611 INFO L78 Accepts]: Start accepts. Automaton has 20445 states and 29105 transitions. Word has length 161 [2018-11-07 20:28:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:49,612 INFO L480 AbstractCegarLoop]: Abstraction has 20445 states and 29105 transitions. [2018-11-07 20:28:49,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:28:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 20445 states and 29105 transitions. [2018-11-07 20:28:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 20:28:49,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:49,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:49,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:49,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 499433324, now seen corresponding path program 1 times [2018-11-07 20:28:49,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:49,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:49,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:28:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:28:49,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:28:49,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:28:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:28:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:49,883 INFO L87 Difference]: Start difference. First operand 20445 states and 29105 transitions. Second operand 4 states. [2018-11-07 20:28:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:28:57,989 INFO L93 Difference]: Finished difference Result 46538 states and 66017 transitions. [2018-11-07 20:28:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:28:57,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-07 20:28:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:28:58,076 INFO L225 Difference]: With dead ends: 46538 [2018-11-07 20:28:58,077 INFO L226 Difference]: Without dead ends: 26099 [2018-11-07 20:28:58,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:28:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26099 states. [2018-11-07 20:28:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26099 to 26098. [2018-11-07 20:28:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26098 states. [2018-11-07 20:28:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26098 states to 26098 states and 32701 transitions. [2018-11-07 20:28:58,642 INFO L78 Accepts]: Start accepts. Automaton has 26098 states and 32701 transitions. Word has length 166 [2018-11-07 20:28:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:28:58,643 INFO L480 AbstractCegarLoop]: Abstraction has 26098 states and 32701 transitions. [2018-11-07 20:28:58,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:28:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26098 states and 32701 transitions. [2018-11-07 20:28:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-07 20:28:58,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:28:58,663 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:28:58,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:28:58,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:28:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2012871233, now seen corresponding path program 1 times [2018-11-07 20:28:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:28:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:28:58,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:28:58,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:28:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:28:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:28:59,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:28:59,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:28:59,439 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-11-07 20:28:59,442 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], [2887], [2889], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [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], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3598], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:28:59,499 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:28:59,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:29:00,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:29:00,681 INFO L272 AbstractInterpreter]: Visited 170 different actions 170 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 20:29:00,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:29:00,720 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:29:02,162 INFO L227 lantSequenceWeakener]: Weakened 307 states. On average, predicates are now at 71.27% of their original sizes. [2018-11-07 20:29:02,163 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:29:02,910 INFO L415 sIntCurrentIteration]: We unified 330 AI predicates to 330 [2018-11-07 20:29:02,911 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:29:02,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:29:02,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:29:02,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:29:02,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:29:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:29:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:29:02,914 INFO L87 Difference]: Start difference. First operand 26098 states and 32701 transitions. Second operand 11 states. [2018-11-07 20:29:17,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:30:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:30:19,129 INFO L93 Difference]: Finished difference Result 52999 states and 66262 transitions. [2018-11-07 20:30:19,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 20:30:19,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 331 [2018-11-07 20:30:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:30:19,218 INFO L225 Difference]: With dead ends: 52999 [2018-11-07 20:30:19,219 INFO L226 Difference]: Without dead ends: 26907 [2018-11-07 20:30:19,266 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 335 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:30:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26907 states. [2018-11-07 20:30:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26907 to 26902. [2018-11-07 20:30:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26902 states. [2018-11-07 20:30:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26902 states to 26902 states and 33516 transitions. [2018-11-07 20:30:19,759 INFO L78 Accepts]: Start accepts. Automaton has 26902 states and 33516 transitions. Word has length 331 [2018-11-07 20:30:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:30:19,760 INFO L480 AbstractCegarLoop]: Abstraction has 26902 states and 33516 transitions. [2018-11-07 20:30:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:30:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26902 states and 33516 transitions. [2018-11-07 20:30:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 20:30:19,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:30:19,784 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:30:19,784 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:30:19,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:30:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 987116952, now seen corresponding path program 1 times [2018-11-07 20:30:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:30:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:30:19,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:30:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:30:19,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:30:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:30:20,242 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:30:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 77 proven. 23 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-07 20:30:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:30:21,589 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:30:21,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 390 with the following transitions: [2018-11-07 20:30:21,591 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], [2887], [2889], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [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], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3599], [3603], [3614], [3618], [3622], [3626], [3630], [3634], [3638], [3642], [3646], [3650], [3654], [3658], [3662], [3666], [3670], [3674], [3678], [3682], [3686], [3690], [3694], [3698], [3709], [3713], [3717], [3721], [3725], [3729], [3733], [3737], [3741], [3745], [3749], [3753], [3757], [3768], [3772], [3776], [3780], [3784], [3788], [3792], [3796], [3800], [3804], [3807], [3812], [3814], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:30:21,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:30:21,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:30:22,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:30:22,426 INFO L272 AbstractInterpreter]: Visited 220 different actions 647 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:30:22,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:30:22,433 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:30:23,046 INFO L227 lantSequenceWeakener]: Weakened 384 states. On average, predicates are now at 71.07% of their original sizes. [2018-11-07 20:30:23,046 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:30:23,245 INFO L415 sIntCurrentIteration]: We unified 388 AI predicates to 388 [2018-11-07 20:30:23,245 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:30:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:30:23,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:30:23,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:30:23,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:30:23,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:30:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:30:23,247 INFO L87 Difference]: Start difference. First operand 26902 states and 33516 transitions. Second operand 11 states. [2018-11-07 20:30:27,587 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:31:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:31:09,693 INFO L93 Difference]: Finished difference Result 57861 states and 71807 transitions. [2018-11-07 20:31:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 20:31:09,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 389 [2018-11-07 20:31:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:31:09,775 INFO L225 Difference]: With dead ends: 57861 [2018-11-07 20:31:09,775 INFO L226 Difference]: Without dead ends: 31769 [2018-11-07 20:31:09,813 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 398 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:31:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31769 states. [2018-11-07 20:31:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31769 to 31760. [2018-11-07 20:31:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31760 states. [2018-11-07 20:31:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31760 states to 31760 states and 38500 transitions. [2018-11-07 20:31:10,281 INFO L78 Accepts]: Start accepts. Automaton has 31760 states and 38500 transitions. Word has length 389 [2018-11-07 20:31:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:31:10,282 INFO L480 AbstractCegarLoop]: Abstraction has 31760 states and 38500 transitions. [2018-11-07 20:31:10,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:31:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31760 states and 38500 transitions. [2018-11-07 20:31:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-07 20:31:10,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:31:10,308 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:31:10,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:31:10,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:31:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash -137317938, now seen corresponding path program 1 times [2018-11-07 20:31:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:31:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:10,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:31:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:31:10,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:31:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 20:31:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 218 proven. 118 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-07 20:31:22,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:31:22,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:31:22,520 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 433 with the following transitions: [2018-11-07 20:31:22,520 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], [2887], [2889], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3598], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 20:31:22,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:31:22,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:31:22,526 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 20:31:22,527 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 20:31:22,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 20:31:22,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:31:22,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:31:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:31:22,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:31:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:31:22,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:31:22,797 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 20:31:22,998 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:31:22,999 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:31:23,004 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:31:23,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:31:23 BoogieIcfgContainer [2018-11-07 20:31:23,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:31:23,005 INFO L168 Benchmark]: Toolchain (without parser) took 210140.37 ms. Allocated memory was 1.5 GB in the beginning and 6.3 GB in the end (delta: 4.8 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,007 INFO L168 Benchmark]: CDTParser took 0.20 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 20:31:23,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2626.53 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 400.13 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.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,009 INFO L168 Benchmark]: Boogie Preprocessor took 295.56 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.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,010 INFO L168 Benchmark]: RCFGBuilder took 9140.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 177.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 544.9 kB). Peak memory consumption was 676.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,011 INFO L168 Benchmark]: TraceAbstraction took 197672.50 ms. Allocated memory was 2.5 GB in the beginning and 6.3 GB in the end (delta: 3.8 GB). Free memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 20:31:23,020 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2626.53 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 400.13 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.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 295.56 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.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9140.53 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 177.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 544.9 kB). Peak memory consumption was 676.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197672.50 ms. Allocated memory was 2.5 GB in the beginning and 6.3 GB in the end (delta: 3.8 GB). Free memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 126). Cancelled while BasicCegarLoop was analyzing trace of length 433 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 197.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 172.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6260 SDtfs, 21040 SDslu, 3480 SDs, 0 SdLazy, 34468 SolverSat, 6667 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 767 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31760occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9984672050528294 AbsIntWeakeningRatio, 0.08217270194986072 AbsIntAvgWeakeningVarsNumRemoved, 11.541782729805014 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 1033 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1324 NumberOfCodeBlocks, 1324 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1317 ConstructedInterpolants, 0 QuantifiedInterpolants, 1252345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 528/553 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown