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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 16:01:26,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 16:01:26,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 16:01:26,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 16:01:26,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 16:01:26,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 16:01:26,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 16:01:26,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 16:01:26,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 16:01:26,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 16:01:26,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 16:01:26,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 16:01:26,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 16:01:26,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 16:01:26,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 16:01:26,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 16:01:26,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 16:01:26,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 16:01:26,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 16:01:26,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 16:01:26,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 16:01:26,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 16:01:26,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 16:01:26,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 16:01:26,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 16:01:26,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 16:01:26,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 16:01:26,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 16:01:26,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 16:01:26,818 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 16:01:26,818 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 16:01:26,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 16:01:26,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 16:01:26,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 16:01:26,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 16:01:26,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 16:01:26,822 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 16:01:26,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 16:01:26,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 16:01:26,851 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 16:01:26,851 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 16:01:26,852 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 16:01:26,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 16:01:26,853 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 16:01:26,853 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 16:01:26,853 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 16:01:26,853 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 16:01:26,854 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 16:01:26,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 16:01:26,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 16:01:26,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 16:01:26,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 16:01:26,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 16:01:26,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 16:01:26,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 16:01:26,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 16:01:26,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 16:01:26,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 16:01:26,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 16:01:26,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 16:01:26,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 16:01:26,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 16:01:26,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 16:01:26,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 16:01:26,860 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 16:01:26,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 16:01:26,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 16:01:26,861 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 16:01:26,861 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 16:01:26,861 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 16:01:26,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 16:01:26,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 16:01:26,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 16:01:26,934 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 16:01:26,935 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 16:01:26,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-09-14 16:01:27,284 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd69e33c/80dfda21763a4fb398aed0bd71c6e70d/FLAGc4f473f3b [2018-09-14 16:01:27,615 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 16:01:27,616 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-09-14 16:01:27,638 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd69e33c/80dfda21763a4fb398aed0bd71c6e70d/FLAGc4f473f3b [2018-09-14 16:01:27,654 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd69e33c/80dfda21763a4fb398aed0bd71c6e70d [2018-09-14 16:01:27,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 16:01:27,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 16:01:27,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 16:01:27,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 16:01:27,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 16:01:27,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:01:27" (1/1) ... [2018-09-14 16:01:27,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aabe07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:27, skipping insertion in model container [2018-09-14 16:01:27,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:01:27" (1/1) ... [2018-09-14 16:01:27,695 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 16:01:28,446 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:01:28,467 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 16:01:28,748 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:01:28,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28 WrapperNode [2018-09-14 16:01:28,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 16:01:28,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 16:01:28,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 16:01:28,831 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 16:01:28,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:28,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:28,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 16:01:28,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 16:01:28,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 16:01:28,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 16:01:29,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (1/1) ... [2018-09-14 16:01:29,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 16:01:29,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 16:01:29,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 16:01:29,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 16:01:29,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (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-09-14 16:01:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 16:01:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 16:01:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 16:01:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 16:01:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 16:01:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 16:01:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 16:01:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 16:01:33,948 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 16:01:33,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:01:33 BoogieIcfgContainer [2018-09-14 16:01:33,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 16:01:33,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 16:01:33,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 16:01:33,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 16:01:33,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 04:01:27" (1/3) ... [2018-09-14 16:01:33,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2036ccc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:01:33, skipping insertion in model container [2018-09-14 16:01:33,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:01:28" (2/3) ... [2018-09-14 16:01:33,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2036ccc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:01:33, skipping insertion in model container [2018-09-14 16:01:33,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:01:33" (3/3) ... [2018-09-14 16:01:33,958 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-09-14 16:01:33,968 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 16:01:33,977 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 16:01:34,037 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 16:01:34,038 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 16:01:34,039 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 16:01:34,039 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 16:01:34,039 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 16:01:34,039 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 16:01:34,039 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 16:01:34,039 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 16:01:34,040 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 16:01:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-14 16:01:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-14 16:01:34,104 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:34,106 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:34,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-09-14 16:01:34,117 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:34,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:34,166 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:35,424 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:35,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 16:01:35,425 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:35,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 16:01:35,449 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 16:01:35,450 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 16:01:35,453 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-09-14 16:01:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:38,221 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-09-14 16:01:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 16:01:38,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-09-14 16:01:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:38,251 INFO L225 Difference]: With dead ends: 1066 [2018-09-14 16:01:38,251 INFO L226 Difference]: Without dead ends: 748 [2018-09-14 16:01:38,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 16:01:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-09-14 16:01:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-09-14 16:01:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-14 16:01:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-09-14 16:01:38,412 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-09-14 16:01:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:38,416 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-09-14 16:01:38,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 16:01:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-09-14 16:01:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-14 16:01:38,436 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:38,437 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:38,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-09-14 16:01:38,440 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:38,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:38,442 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:38,884 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-14 16:01:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:39,092 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:39,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:01:39,092 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:39,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:01:39,097 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:01:39,097 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:01:39,097 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-09-14 16:01:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:42,059 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-09-14 16:01:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 16:01:42,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-09-14 16:01:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:42,070 INFO L225 Difference]: With dead ends: 1590 [2018-09-14 16:01:42,071 INFO L226 Difference]: Without dead ends: 1069 [2018-09-14 16:01:42,074 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-09-14 16:01:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-09-14 16:01:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-09-14 16:01:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-14 16:01:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-09-14 16:01:42,131 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-09-14 16:01:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:42,132 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-09-14 16:01:42,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:01:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-09-14 16:01:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-14 16:01:42,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:42,138 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:42,139 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-09-14 16:01:42,139 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:42,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:42,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:42,141 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:42,407 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:01:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:42,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:42,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 16:01:42,654 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:42,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:01:42,656 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:01:42,657 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:01:42,657 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-09-14 16:01:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:45,728 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-09-14 16:01:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:01:45,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-09-14 16:01:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:45,744 INFO L225 Difference]: With dead ends: 3166 [2018-09-14 16:01:45,745 INFO L226 Difference]: Without dead ends: 2148 [2018-09-14 16:01:45,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-14 16:01:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-09-14 16:01:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-09-14 16:01:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-09-14 16:01:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-09-14 16:01:45,834 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-09-14 16:01:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:45,835 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-09-14 16:01:45,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:01:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-09-14 16:01:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-14 16:01:45,846 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:45,846 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:45,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-09-14 16:01:45,847 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:45,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:45,848 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:46,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:46,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:01:46,180 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:46,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:01:46,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:01:46,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:01:46,181 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-09-14 16:01:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:49,299 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-09-14 16:01:49,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:01:49,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-09-14 16:01:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:49,329 INFO L225 Difference]: With dead ends: 6108 [2018-09-14 16:01:49,329 INFO L226 Difference]: Without dead ends: 4009 [2018-09-14 16:01:49,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:01:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-09-14 16:01:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-09-14 16:01:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-09-14 16:01:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-09-14 16:01:49,481 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-09-14 16:01:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:49,482 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-09-14 16:01:49,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:01:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-09-14 16:01:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-14 16:01:49,500 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:49,501 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:49,501 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-09-14 16:01:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:49,503 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:49,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:49,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-14 16:01:49,885 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:49,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 16:01:49,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 16:01:49,886 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:01:49,886 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-09-14 16:01:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:52,100 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-09-14 16:01:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:01:52,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-09-14 16:01:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:52,167 INFO L225 Difference]: With dead ends: 12096 [2018-09-14 16:01:52,167 INFO L226 Difference]: Without dead ends: 8129 [2018-09-14 16:01:52,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-09-14 16:01:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-09-14 16:01:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-09-14 16:01:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-09-14 16:01:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-09-14 16:01:52,535 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-09-14 16:01:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:52,536 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-09-14 16:01:52,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 16:01:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-09-14 16:01:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-14 16:01:52,574 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:52,575 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:52,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-09-14 16:01:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:52,577 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:52,853 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:01:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:01:53,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:53,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:01:53,261 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:01:53,262 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:01:53,263 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:01:53,263 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-09-14 16:01:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:01:56,023 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-09-14 16:01:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:01:56,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-09-14 16:01:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:01:56,119 INFO L225 Difference]: With dead ends: 22960 [2018-09-14 16:01:56,119 INFO L226 Difference]: Without dead ends: 15024 [2018-09-14 16:01:56,151 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-09-14 16:01:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-09-14 16:01:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-09-14 16:01:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-09-14 16:01:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-09-14 16:01:56,691 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-09-14 16:01:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:01:56,692 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-09-14 16:01:56,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:01:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-09-14 16:01:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-14 16:01:56,756 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:01:56,757 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:01:56,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:01:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-09-14 16:01:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:01:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:01:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:01:56,759 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:01:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:01:57,414 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 16:01:57,672 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-14 16:01:58,253 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 16:01:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-14 16:01:58,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:01:58,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:01:58,460 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:01:58,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:01:58,461 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:01:58,461 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:01:58,461 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-09-14 16:02:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:02:02,969 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-09-14 16:02:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 16:02:02,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-09-14 16:02:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:02:03,041 INFO L225 Difference]: With dead ends: 31818 [2018-09-14 16:02:03,041 INFO L226 Difference]: Without dead ends: 16918 [2018-09-14 16:02:03,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:02:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-09-14 16:02:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-09-14 16:02:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-09-14 16:02:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-09-14 16:02:03,760 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-09-14 16:02:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:02:03,761 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-09-14 16:02:03,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:02:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-09-14 16:02:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-14 16:02:03,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:02:03,840 INFO L376 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, 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] [2018-09-14 16:02:03,840 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:02:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-09-14 16:02:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:02:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:03,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:03,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:03,843 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:02:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:04,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:02:04,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:02:04,194 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:02:04,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:02:04,195 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:02:04,195 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:02:04,196 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-09-14 16:02:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:02:06,289 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-09-14 16:02:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:02:06,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-09-14 16:02:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:02:06,438 INFO L225 Difference]: With dead ends: 46520 [2018-09-14 16:02:06,438 INFO L226 Difference]: Without dead ends: 29610 [2018-09-14 16:02:06,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:02:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-09-14 16:02:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-09-14 16:02:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-09-14 16:02:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-09-14 16:02:07,191 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-09-14 16:02:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:02:07,191 INFO L480 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-09-14 16:02:07,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:02:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-09-14 16:02:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-14 16:02:07,259 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:02:07,259 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:02:07,259 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:02:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-09-14 16:02:07,260 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:02:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:07,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:07,261 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:02:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:07,555 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:02:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:02:07,751 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:02:07,752 INFO L197 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-09-14 16:02:08,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:08,051 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:02:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:08,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:02:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:02:08,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:02:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:02:09,433 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:02:09,433 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:02:09,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:09,469 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:02:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:10,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:02:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:02:10,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:02:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:02:10,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:02:10,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 15 [2018-09-14 16:02:10,802 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:02:10,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 16:02:10,804 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 16:02:10,804 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:02:10,807 INFO L87 Difference]: Start difference. First operand 29560 states and 45643 transitions. Second operand 13 states. [2018-09-14 16:02:13,923 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 16:02:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:02:22,603 INFO L93 Difference]: Finished difference Result 139445 states and 271872 transitions. [2018-09-14 16:02:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-14 16:02:22,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 296 [2018-09-14 16:02:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:02:24,088 INFO L225 Difference]: With dead ends: 139445 [2018-09-14 16:02:24,089 INFO L226 Difference]: Without dead ends: 109891 [2018-09-14 16:02:24,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1245 GetRequests, 1202 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2018-09-14 16:02:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109891 states. [2018-09-14 16:02:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109891 to 105251. [2018-09-14 16:02:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105251 states. [2018-09-14 16:02:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105251 states to 105251 states and 159037 transitions. [2018-09-14 16:02:29,190 INFO L78 Accepts]: Start accepts. Automaton has 105251 states and 159037 transitions. Word has length 296 [2018-09-14 16:02:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:02:29,191 INFO L480 AbstractCegarLoop]: Abstraction has 105251 states and 159037 transitions. [2018-09-14 16:02:29,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 16:02:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 105251 states and 159037 transitions. [2018-09-14 16:02:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-14 16:02:29,357 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:02:29,357 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:02:29,357 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:02:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 153311223, now seen corresponding path program 1 times [2018-09-14 16:02:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:02:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:29,359 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:02:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:30,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:02:30,767 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:02:30,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:30,775 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:02:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:30,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:02:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:31,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:02:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:31,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:02:31,612 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:02:31,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:31,627 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:02:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:32,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:02:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:32,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:02:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:02:33,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:02:33,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-14 16:02:33,286 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:02:33,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:02:33,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:02:33,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-14 16:02:33,287 INFO L87 Difference]: Start difference. First operand 105251 states and 159037 transitions. Second operand 9 states. [2018-09-14 16:02:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:02:39,468 INFO L93 Difference]: Finished difference Result 278618 states and 422400 transitions. [2018-09-14 16:02:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 16:02:39,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2018-09-14 16:02:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:02:40,326 INFO L225 Difference]: With dead ends: 278618 [2018-09-14 16:02:40,326 INFO L226 Difference]: Without dead ends: 173373 [2018-09-14 16:02:40,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1268 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-09-14 16:02:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173373 states. [2018-09-14 16:02:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173373 to 167366. [2018-09-14 16:02:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167366 states. [2018-09-14 16:02:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167366 states to 167366 states and 234707 transitions. [2018-09-14 16:02:45,913 INFO L78 Accepts]: Start accepts. Automaton has 167366 states and 234707 transitions. Word has length 319 [2018-09-14 16:02:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:02:45,913 INFO L480 AbstractCegarLoop]: Abstraction has 167366 states and 234707 transitions. [2018-09-14 16:02:45,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:02:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 167366 states and 234707 transitions. [2018-09-14 16:02:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-09-14 16:02:46,129 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:02:46,130 INFO L376 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, 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] [2018-09-14 16:02:46,130 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:02:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2039131367, now seen corresponding path program 1 times [2018-09-14 16:02:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:02:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:02:46,132 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:02:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:46,417 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:02:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 133 proven. 58 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:02:46,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:02:46,513 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:02:46,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:02:46,527 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:02:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:02:46,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:02:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-14 16:02:47,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:02:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 133 proven. 58 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:02:47,509 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:02:47,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2018-09-14 16:02:47,510 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:02:47,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:02:47,510 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:02:47,510 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-14 16:02:47,511 INFO L87 Difference]: Start difference. First operand 167366 states and 234707 transitions. Second operand 6 states. [2018-09-14 16:02:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:02:54,205 INFO L93 Difference]: Finished difference Result 339847 states and 492749 transitions. [2018-09-14 16:02:54,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 16:02:54,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 347 [2018-09-14 16:02:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:02:55,491 INFO L225 Difference]: With dead ends: 339847 [2018-09-14 16:02:55,491 INFO L226 Difference]: Without dead ends: 172485 [2018-09-14 16:02:55,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 686 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-09-14 16:02:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172485 states. [2018-09-14 16:03:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172485 to 169182. [2018-09-14 16:03:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169182 states. [2018-09-14 16:03:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169182 states to 169182 states and 236932 transitions. [2018-09-14 16:03:08,956 INFO L78 Accepts]: Start accepts. Automaton has 169182 states and 236932 transitions. Word has length 347 [2018-09-14 16:03:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:03:08,956 INFO L480 AbstractCegarLoop]: Abstraction has 169182 states and 236932 transitions. [2018-09-14 16:03:08,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:03:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 169182 states and 236932 transitions. [2018-09-14 16:03:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-14 16:03:09,240 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:03:09,241 INFO L376 BasicCegarLoop]: trace histogram [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, 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] [2018-09-14 16:03:09,241 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:03:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -666543532, now seen corresponding path program 1 times [2018-09-14 16:03:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:03:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:09,243 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:03:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 167 proven. 62 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-14 16:03:09,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:03:09,624 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:03:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:09,636 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:03:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:09,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:03:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-14 16:03:09,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:03:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 167 proven. 62 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-14 16:03:10,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:03:10,160 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:03:10,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:10,176 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:03:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:10,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:03:11,100 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-09-14 16:03:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-14 16:03:11,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:03:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 167 proven. 62 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-14 16:03:11,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:03:11,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-14 16:03:11,404 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:03:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:03:11,405 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:03:11,405 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:03:11,405 INFO L87 Difference]: Start difference. First operand 169182 states and 236932 transitions. Second operand 9 states. [2018-09-14 16:03:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:03:39,450 INFO L93 Difference]: Finished difference Result 661887 states and 1272023 transitions. [2018-09-14 16:03:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-14 16:03:39,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 364 [2018-09-14 16:03:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:03:46,105 INFO L225 Difference]: With dead ends: 661887 [2018-09-14 16:03:46,106 INFO L226 Difference]: Without dead ends: 492711 [2018-09-14 16:03:46,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1483 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=503, Invalid=2253, Unknown=0, NotChecked=0, Total=2756 [2018-09-14 16:03:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492711 states. [2018-09-14 16:04:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492711 to 447604. [2018-09-14 16:04:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447604 states. [2018-09-14 16:04:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447604 states to 447604 states and 616154 transitions. [2018-09-14 16:04:24,913 INFO L78 Accepts]: Start accepts. Automaton has 447604 states and 616154 transitions. Word has length 364 [2018-09-14 16:04:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:24,914 INFO L480 AbstractCegarLoop]: Abstraction has 447604 states and 616154 transitions. [2018-09-14 16:04:24,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:04:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 447604 states and 616154 transitions. [2018-09-14 16:04:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-14 16:04:25,488 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:25,489 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:04:25,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -564774967, now seen corresponding path program 1 times [2018-09-14 16:04:25,490 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:25,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:25,491 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:26,337 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:26,337 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:26,352 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:26,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:26,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:26,998 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:26,999 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:27,020 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:27,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:27,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 161 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:28,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:28,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 8, 8] total 19 [2018-09-14 16:04:28,404 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:28,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 16:04:28,405 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 16:04:28,405 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-14 16:04:28,405 INFO L87 Difference]: Start difference. First operand 447604 states and 616154 transitions. Second operand 8 states. [2018-09-14 16:04:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:46,534 INFO L93 Difference]: Finished difference Result 873429 states and 1301500 transitions. [2018-09-14 16:04:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-14 16:04:46,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 368 [2018-09-14 16:04:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-09-14 16:04:48,823 INFO L225 Difference]: With dead ends: 873429 [2018-09-14 16:04:48,823 INFO L226 Difference]: Without dead ends: 425828 [2018-09-14 16:04:49,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1483 GetRequests, 1462 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-09-14 16:04:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425828 states. [2018-09-14 16:04:50,015 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 16:04:50,018 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 16:04:50,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 04:04:50 BoogieIcfgContainer [2018-09-14 16:04:50,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 16:04:50,020 INFO L168 Benchmark]: Toolchain (without parser) took 202353.03 ms. Allocated memory was 1.5 GB in the beginning and 6.8 GB in the end (delta: 5.3 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -982.3 MB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,021 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-09-14 16:04:50,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1158.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,023 INFO L168 Benchmark]: Boogie Preprocessor took 401.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 766.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,024 INFO L168 Benchmark]: RCFGBuilder took 4566.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.4 MB). Peak memory consumption was 260.4 MB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,024 INFO L168 Benchmark]: TraceAbstraction took 196068.79 ms. Allocated memory was 2.2 GB in the beginning and 6.8 GB in the end (delta: 4.5 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -447.4 MB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. [2018-09-14 16:04:50,029 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.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 1158.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 150.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 401.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 766.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -901.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4566.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.4 MB). Peak memory consumption was 260.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196068.79 ms. Allocated memory was 2.2 GB in the beginning and 6.8 GB in the end (delta: 4.5 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -447.4 MB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 195.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 110.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2320 SDtfs, 19864 SDslu, 3330 SDs, 0 SdLazy, 25269 SolverSat, 5811 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6324 GetRequests, 6122 SyntacticMatches, 18 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447604occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 64.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 59799 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 6587 NumberOfCodeBlocks, 6587 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9597 ConstructedInterpolants, 0 QuantifiedInterpolants, 7929513 SizeOfPredicates, 30 NumberOfNonLiveVariables, 11015 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 3911/4383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label17_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_16-04-50-043.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label17_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_16-04-50-043.csv Completed graceful shutdown