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/Problem17_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 12:12:47,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 12:12:47,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 12:12:47,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 12:12:47,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 12:12:47,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 12:12:47,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 12:12:47,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 12:12:47,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 12:12:47,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 12:12:47,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 12:12:47,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 12:12:47,986 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 12:12:47,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 12:12:47,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 12:12:47,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 12:12:47,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 12:12:47,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 12:12:47,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 12:12:47,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 12:12:47,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 12:12:47,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 12:12:48,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 12:12:48,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 12:12:48,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 12:12:48,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 12:12:48,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 12:12:48,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 12:12:48,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 12:12:48,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 12:12:48,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 12:12:48,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 12:12:48,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 12:12:48,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 12:12:48,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 12:12:48,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 12:12:48,010 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-18 12:12:48,032 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 12:12:48,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 12:12:48,033 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 12:12:48,034 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 12:12:48,034 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 12:12:48,034 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 12:12:48,039 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 12:12:48,039 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 12:12:48,039 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 12:12:48,039 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 12:12:48,040 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 12:12:48,040 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 12:12:48,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 12:12:48,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 12:12:48,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 12:12:48,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 12:12:48,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 12:12:48,042 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 12:12:48,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 12:12:48,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 12:12:48,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 12:12:48,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 12:12:48,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 12:12:48,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 12:12:48,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 12:12:48,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 12:12:48,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 12:12:48,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 12:12:48,045 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 12:12:48,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 12:12:48,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 12:12:48,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 12:12:48,046 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 12:12:48,046 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 12:12:48,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 12:12:48,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 12:12:48,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 12:12:48,132 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 12:12:48,133 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 12:12:48,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-09-18 12:12:48,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc85b618/2efa3227ce5b4fc08ac4912ae2d700ad/FLAG9b92a7d73 [2018-09-18 12:12:48,871 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 12:12:48,872 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-09-18 12:12:48,897 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc85b618/2efa3227ce5b4fc08ac4912ae2d700ad/FLAG9b92a7d73 [2018-09-18 12:12:48,913 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc85b618/2efa3227ce5b4fc08ac4912ae2d700ad [2018-09-18 12:12:48,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 12:12:48,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 12:12:48,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 12:12:48,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 12:12:48,937 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 12:12:48,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 12:12:48" (1/1) ... [2018-09-18 12:12:48,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2a0e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:48, skipping insertion in model container [2018-09-18 12:12:48,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 12:12:48" (1/1) ... [2018-09-18 12:12:48,954 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 12:12:50,011 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 12:12:50,031 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 12:12:50,746 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 12:12:51,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51 WrapperNode [2018-09-18 12:12:51,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 12:12:51,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 12:12:51,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 12:12:51,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 12:12:51,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:51,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:51,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 12:12:51,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 12:12:51,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 12:12:51,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 12:12:51,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:51,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:51,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:51,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:52,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:52,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:52,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (1/1) ... [2018-09-18 12:12:52,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 12:12:52,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 12:12:52,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 12:12:52,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 12:12:52,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (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-18 12:12:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 12:12:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 12:12:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-18 12:12:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-18 12:12:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 12:12:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 12:12:52,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 12:12:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 12:12:52,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 12:12:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 12:13:03,731 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 12:13:03,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 12:13:03 BoogieIcfgContainer [2018-09-18 12:13:03,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 12:13:03,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 12:13:03,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 12:13:03,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 12:13:03,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 12:12:48" (1/3) ... [2018-09-18 12:13:03,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c62de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 12:13:03, skipping insertion in model container [2018-09-18 12:13:03,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 12:12:51" (2/3) ... [2018-09-18 12:13:03,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c62de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 12:13:03, skipping insertion in model container [2018-09-18 12:13:03,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 12:13:03" (3/3) ... [2018-09-18 12:13:03,741 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label21_true-unreach-call.c [2018-09-18 12:13:03,752 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 12:13:03,762 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 12:13:03,825 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 12:13:03,826 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 12:13:03,826 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 12:13:03,826 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 12:13:03,826 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 12:13:03,826 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 12:13:03,826 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 12:13:03,827 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 12:13:03,827 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 12:13:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-18 12:13:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-18 12:13:03,873 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:03,874 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] [2018-09-18 12:13:03,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1861558100, now seen corresponding path program 1 times [2018-09-18 12:13:03,884 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:03,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:03,943 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:04,399 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-18 12:13:04,402 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:04,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:13:04,402 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:04,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:13:04,423 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:13:04,424 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:04,427 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-09-18 12:13:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:13,665 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-09-18 12:13:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:13:13,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-09-18 12:13:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:13,702 INFO L225 Difference]: With dead ends: 2166 [2018-09-18 12:13:13,703 INFO L226 Difference]: Without dead ends: 1556 [2018-09-18 12:13:13,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-09-18 12:13:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-09-18 12:13:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-09-18 12:13:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-09-18 12:13:13,840 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 66 [2018-09-18 12:13:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:13,841 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-09-18 12:13:13,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:13:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-09-18 12:13:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-18 12:13:13,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:13,850 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, 1, 1, 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-18 12:13:13,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -436141222, now seen corresponding path program 1 times [2018-09-18 12:13:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:13,853 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:14,189 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 12:13:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 12:13:14,236 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:14,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 12:13:14,237 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:14,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 12:13:14,239 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 12:13:14,239 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 12:13:14,240 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-09-18 12:13:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:23,703 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-09-18 12:13:23,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 12:13:23,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-09-18 12:13:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:23,724 INFO L225 Difference]: With dead ends: 3059 [2018-09-18 12:13:23,725 INFO L226 Difference]: Without dead ends: 1997 [2018-09-18 12:13:23,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 12:13:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-09-18 12:13:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-09-18 12:13:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-09-18 12:13:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-09-18 12:13:23,912 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 142 [2018-09-18 12:13:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:23,913 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-09-18 12:13:23,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 12:13:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-09-18 12:13:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-18 12:13:23,917 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:23,917 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, 1, 1, 1, 1, 1, 1, 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-18 12:13:23,917 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1261890222, now seen corresponding path program 1 times [2018-09-18 12:13:23,918 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:23,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:23,919 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 12:13:24,141 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:24,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 12:13:24,141 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:24,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 12:13:24,142 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 12:13:24,142 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 12:13:24,143 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-09-18 12:13:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:29,505 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-09-18 12:13:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 12:13:29,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-09-18 12:13:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:29,524 INFO L225 Difference]: With dead ends: 4880 [2018-09-18 12:13:29,525 INFO L226 Difference]: Without dead ends: 2911 [2018-09-18 12:13:29,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 12:13:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-09-18 12:13:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-09-18 12:13:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-09-18 12:13:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-09-18 12:13:29,615 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 146 [2018-09-18 12:13:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:29,616 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-09-18 12:13:29,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 12:13:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-09-18 12:13:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-18 12:13:29,619 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:29,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:13:29,619 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1548926097, now seen corresponding path program 1 times [2018-09-18 12:13:29,620 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:29,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:29,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:29,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:29,621 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 12:13:29,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:29,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:13:29,825 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:29,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:13:29,826 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:13:29,826 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:29,826 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-09-18 12:13:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:37,598 INFO L93 Difference]: Finished difference Result 6193 states and 8530 transitions. [2018-09-18 12:13:37,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:13:37,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-09-18 12:13:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:37,618 INFO L225 Difference]: With dead ends: 6193 [2018-09-18 12:13:37,619 INFO L226 Difference]: Without dead ends: 3319 [2018-09-18 12:13:37,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-09-18 12:13:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3319. [2018-09-18 12:13:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2018-09-18 12:13:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4368 transitions. [2018-09-18 12:13:37,741 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4368 transitions. Word has length 176 [2018-09-18 12:13:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:37,742 INFO L480 AbstractCegarLoop]: Abstraction has 3319 states and 4368 transitions. [2018-09-18 12:13:37,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:13:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4368 transitions. [2018-09-18 12:13:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-18 12:13:37,749 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:37,749 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, 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] [2018-09-18 12:13:37,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -639298360, now seen corresponding path program 1 times [2018-09-18 12:13:37,750 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:37,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:37,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:37,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:37,752 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-09-18 12:13:38,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:38,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:13:38,016 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:38,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:13:38,017 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:13:38,017 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:38,017 INFO L87 Difference]: Start difference. First operand 3319 states and 4368 transitions. Second operand 4 states. [2018-09-18 12:13:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:46,605 INFO L93 Difference]: Finished difference Result 11927 states and 16025 transitions. [2018-09-18 12:13:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:13:46,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-09-18 12:13:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:46,644 INFO L225 Difference]: With dead ends: 11927 [2018-09-18 12:13:46,645 INFO L226 Difference]: Without dead ends: 8614 [2018-09-18 12:13:46,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2018-09-18 12:13:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 8610. [2018-09-18 12:13:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8610 states. [2018-09-18 12:13:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 10546 transitions. [2018-09-18 12:13:46,896 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 10546 transitions. Word has length 230 [2018-09-18 12:13:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:46,897 INFO L480 AbstractCegarLoop]: Abstraction has 8610 states and 10546 transitions. [2018-09-18 12:13:46,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:13:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 10546 transitions. [2018-09-18 12:13:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-18 12:13:46,904 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:46,904 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 12:13:46,905 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1380574037, now seen corresponding path program 1 times [2018-09-18 12:13:46,905 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:46,907 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:47,728 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-18 12:13:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 118 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 12:13:48,028 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:13:48,028 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-18 12:13:48,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:48,038 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:13:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:48,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:13:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-18 12:13:48,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:13:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 118 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 12:13:49,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 12:13:49,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 12:13:49,262 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:49,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 12:13:49,263 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 12:13:49,263 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-18 12:13:49,263 INFO L87 Difference]: Start difference. First operand 8610 states and 10546 transitions. Second operand 5 states. [2018-09-18 12:13:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:13:58,347 INFO L93 Difference]: Finished difference Result 20028 states and 24397 transitions. [2018-09-18 12:13:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 12:13:58,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2018-09-18 12:13:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:13:58,410 INFO L225 Difference]: With dead ends: 20028 [2018-09-18 12:13:58,411 INFO L226 Difference]: Without dead ends: 11424 [2018-09-18 12:13:58,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-18 12:13:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11424 states. [2018-09-18 12:13:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11424 to 11378. [2018-09-18 12:13:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11378 states. [2018-09-18 12:13:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 13758 transitions. [2018-09-18 12:13:58,927 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 13758 transitions. Word has length 253 [2018-09-18 12:13:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:13:58,927 INFO L480 AbstractCegarLoop]: Abstraction has 11378 states and 13758 transitions. [2018-09-18 12:13:58,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 12:13:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 13758 transitions. [2018-09-18 12:13:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-18 12:13:58,944 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:13:58,945 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 12:13:58,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:13:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 757180591, now seen corresponding path program 1 times [2018-09-18 12:13:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:13:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:13:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:13:58,949 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:13:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:13:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-09-18 12:13:59,398 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:13:59,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:13:59,398 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:13:59,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:13:59,399 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:13:59,399 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:13:59,399 INFO L87 Difference]: Start difference. First operand 11378 states and 13758 transitions. Second operand 4 states. [2018-09-18 12:14:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:14:11,290 INFO L93 Difference]: Finished difference Result 29710 states and 36498 transitions. [2018-09-18 12:14:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:14:11,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-09-18 12:14:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:14:11,358 INFO L225 Difference]: With dead ends: 29710 [2018-09-18 12:14:11,358 INFO L226 Difference]: Without dead ends: 18338 [2018-09-18 12:14:11,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:14:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18338 states. [2018-09-18 12:14:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18338 to 18321. [2018-09-18 12:14:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18321 states. [2018-09-18 12:14:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 21764 transitions. [2018-09-18 12:14:11,747 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 21764 transitions. Word has length 296 [2018-09-18 12:14:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:14:11,748 INFO L480 AbstractCegarLoop]: Abstraction has 18321 states and 21764 transitions. [2018-09-18 12:14:11,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:14:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 21764 transitions. [2018-09-18 12:14:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-18 12:14:11,763 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:14:11,763 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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-18 12:14:11,763 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:14:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1570509174, now seen corresponding path program 1 times [2018-09-18 12:14:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:14:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:11,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:11,765 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:14:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 142 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-09-18 12:14:12,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:14:12,609 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 12:14:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:12,617 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:14:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:14:13,070 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-09-18 12:14:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-18 12:14:13,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:14:14,092 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-09-18 12:14:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 12:14:14,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:14:14,573 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 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 12:14:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:14,588 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:14:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:14,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:14:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-18 12:14:15,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:14:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 12:14:15,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 12:14:15,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 7, 8] total 16 [2018-09-18 12:14:15,513 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 12:14:15,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-18 12:14:15,515 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-18 12:14:15,515 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-18 12:14:15,516 INFO L87 Difference]: Start difference. First operand 18321 states and 21764 transitions. Second operand 10 states. [2018-09-18 12:14:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:14:38,281 INFO L93 Difference]: Finished difference Result 55379 states and 68848 transitions. [2018-09-18 12:14:38,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-18 12:14:38,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2018-09-18 12:14:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:14:38,418 INFO L225 Difference]: With dead ends: 55379 [2018-09-18 12:14:38,418 INFO L226 Difference]: Without dead ends: 37064 [2018-09-18 12:14:38,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1214 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-09-18 12:14:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37064 states. [2018-09-18 12:14:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37064 to 35275. [2018-09-18 12:14:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35275 states. [2018-09-18 12:14:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35275 states to 35275 states and 43194 transitions. [2018-09-18 12:14:39,584 INFO L78 Accepts]: Start accepts. Automaton has 35275 states and 43194 transitions. Word has length 305 [2018-09-18 12:14:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:14:39,585 INFO L480 AbstractCegarLoop]: Abstraction has 35275 states and 43194 transitions. [2018-09-18 12:14:39,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-18 12:14:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 35275 states and 43194 transitions. [2018-09-18 12:14:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-18 12:14:39,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:14:39,609 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 12:14:39,609 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:14:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1860730581, now seen corresponding path program 1 times [2018-09-18 12:14:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:14:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:39,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:39,611 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:14:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-09-18 12:14:40,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:14:40,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:14:40,060 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:14:40,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:14:40,061 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:14:40,061 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:14:40,061 INFO L87 Difference]: Start difference. First operand 35275 states and 43194 transitions. Second operand 4 states. [2018-09-18 12:14:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:14:49,891 INFO L93 Difference]: Finished difference Result 88351 states and 110668 transitions. [2018-09-18 12:14:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:14:49,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-09-18 12:14:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:14:50,092 INFO L225 Difference]: With dead ends: 88351 [2018-09-18 12:14:50,092 INFO L226 Difference]: Without dead ends: 53523 [2018-09-18 12:14:50,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-18 12:14:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53523 states. [2018-09-18 12:14:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53523 to 44540. [2018-09-18 12:14:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44540 states. [2018-09-18 12:14:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44540 states to 44540 states and 53750 transitions. [2018-09-18 12:14:51,704 INFO L78 Accepts]: Start accepts. Automaton has 44540 states and 53750 transitions. Word has length 328 [2018-09-18 12:14:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:14:51,705 INFO L480 AbstractCegarLoop]: Abstraction has 44540 states and 53750 transitions. [2018-09-18 12:14:51,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:14:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44540 states and 53750 transitions. [2018-09-18 12:14:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-18 12:14:51,736 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:14:51,736 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 12:14:51,737 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:14:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1332328749, now seen corresponding path program 1 times [2018-09-18 12:14:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:14:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:51,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:14:51,739 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:14:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 465 proven. 2 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-18 12:14:52,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:14:52,265 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 12:14:52,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:52,276 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:14:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:52,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:14:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-09-18 12:14:52,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:14:53,309 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-18 12:14:53,460 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-09-18 12:14:53,592 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-18 12:14:54,160 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-18 12:14:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 319 proven. 147 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-09-18 12:14:54,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:14:54,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 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 12:14:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:14:54,646 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:14:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:14:54,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:14:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 418 proven. 2 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-09-18 12:14:55,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:14:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 249 proven. 281 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-09-18 12:14:55,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 12:14:55,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 14 [2018-09-18 12:14:55,829 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 12:14:55,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-18 12:14:55,830 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-18 12:14:55,831 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-09-18 12:14:55,831 INFO L87 Difference]: Start difference. First operand 44540 states and 53750 transitions. Second operand 8 states. [2018-09-18 12:15:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:13,476 INFO L93 Difference]: Finished difference Result 122393 states and 148924 transitions. [2018-09-18 12:15:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-18 12:15:13,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 402 [2018-09-18 12:15:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:13,651 INFO L225 Difference]: With dead ends: 122393 [2018-09-18 12:15:13,651 INFO L226 Difference]: Without dead ends: 49122 [2018-09-18 12:15:13,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1660 GetRequests, 1620 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2018-09-18 12:15:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49122 states. [2018-09-18 12:15:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49122 to 44881. [2018-09-18 12:15:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44881 states. [2018-09-18 12:15:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44881 states to 44881 states and 51898 transitions. [2018-09-18 12:15:15,013 INFO L78 Accepts]: Start accepts. Automaton has 44881 states and 51898 transitions. Word has length 402 [2018-09-18 12:15:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:15,013 INFO L480 AbstractCegarLoop]: Abstraction has 44881 states and 51898 transitions. [2018-09-18 12:15:15,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-18 12:15:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44881 states and 51898 transitions. [2018-09-18 12:15:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-09-18 12:15:15,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:15,035 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 12:15:15,036 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -391628634, now seen corresponding path program 1 times [2018-09-18 12:15:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:15,037 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-09-18 12:15:15,488 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:15:15,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 12:15:15,488 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:15:15,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 12:15:15,490 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 12:15:15,490 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 12:15:15,490 INFO L87 Difference]: Start difference. First operand 44881 states and 51898 transitions. Second operand 3 states. [2018-09-18 12:15:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:19,348 INFO L93 Difference]: Finished difference Result 110267 states and 129574 transitions. [2018-09-18 12:15:19,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 12:15:19,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-09-18 12:15:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:19,501 INFO L225 Difference]: With dead ends: 110267 [2018-09-18 12:15:19,502 INFO L226 Difference]: Without dead ends: 64939 [2018-09-18 12:15:19,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 12:15:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64939 states. [2018-09-18 12:15:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64939 to 61015. [2018-09-18 12:15:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61015 states. [2018-09-18 12:15:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61015 states to 61015 states and 70140 transitions. [2018-09-18 12:15:20,515 INFO L78 Accepts]: Start accepts. Automaton has 61015 states and 70140 transitions. Word has length 461 [2018-09-18 12:15:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:20,515 INFO L480 AbstractCegarLoop]: Abstraction has 61015 states and 70140 transitions. [2018-09-18 12:15:20,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 12:15:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 61015 states and 70140 transitions. [2018-09-18 12:15:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-09-18 12:15:20,540 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:20,540 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 12:15:20,541 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash -67504576, now seen corresponding path program 1 times [2018-09-18 12:15:20,541 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:20,542 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-18 12:15:21,721 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:15:21,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 12:15:21,722 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:15:21,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 12:15:21,723 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 12:15:21,723 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:15:21,723 INFO L87 Difference]: Start difference. First operand 61015 states and 70140 transitions. Second operand 4 states. [2018-09-18 12:15:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:26,679 INFO L93 Difference]: Finished difference Result 144368 states and 167379 transitions. [2018-09-18 12:15:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 12:15:26,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 470 [2018-09-18 12:15:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:26,871 INFO L225 Difference]: With dead ends: 144368 [2018-09-18 12:15:26,871 INFO L226 Difference]: Without dead ends: 82043 [2018-09-18 12:15:26,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 12:15:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82043 states. [2018-09-18 12:15:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82043 to 76378. [2018-09-18 12:15:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76378 states. [2018-09-18 12:15:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76378 states to 76378 states and 87007 transitions. [2018-09-18 12:15:28,101 INFO L78 Accepts]: Start accepts. Automaton has 76378 states and 87007 transitions. Word has length 470 [2018-09-18 12:15:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 76378 states and 87007 transitions. [2018-09-18 12:15:28,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 12:15:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76378 states and 87007 transitions. [2018-09-18 12:15:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-09-18 12:15:28,157 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:28,158 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 12:15:28,158 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1178967, now seen corresponding path program 1 times [2018-09-18 12:15:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:28,160 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-09-18 12:15:29,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:15:29,289 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-18 12:15:29,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:29,299 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:15:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:29,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:15:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-18 12:15:29,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:15:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-09-18 12:15:30,294 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 12:15:30,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-18 12:15:30,295 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:15:30,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 12:15:30,296 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 12:15:30,297 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 12:15:30,297 INFO L87 Difference]: Start difference. First operand 76378 states and 87007 transitions. Second operand 3 states. [2018-09-18 12:15:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:35,326 INFO L93 Difference]: Finished difference Result 154929 states and 176888 transitions. [2018-09-18 12:15:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 12:15:35,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2018-09-18 12:15:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:35,477 INFO L225 Difference]: With dead ends: 154929 [2018-09-18 12:15:35,477 INFO L226 Difference]: Without dead ends: 78992 [2018-09-18 12:15:35,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1346 GetRequests, 1345 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-18 12:15:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78992 states. [2018-09-18 12:15:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78992 to 77252. [2018-09-18 12:15:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77252 states. [2018-09-18 12:15:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77252 states to 77252 states and 87628 transitions. [2018-09-18 12:15:36,366 INFO L78 Accepts]: Start accepts. Automaton has 77252 states and 87628 transitions. Word has length 672 [2018-09-18 12:15:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:36,368 INFO L480 AbstractCegarLoop]: Abstraction has 77252 states and 87628 transitions. [2018-09-18 12:15:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 12:15:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 77252 states and 87628 transitions. [2018-09-18 12:15:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-09-18 12:15:36,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:36,442 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-18 12:15:36,442 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 314044229, now seen corresponding path program 1 times [2018-09-18 12:15:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:36,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:36,444 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 321 proven. 4 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2018-09-18 12:15:37,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:15:37,536 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 12:15:37,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:37,551 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:15:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:37,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:15:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 1010 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-09-18 12:15:38,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:15:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-09-18 12:15:39,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 12:15:39,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-09-18 12:15:39,835 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:15:39,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 12:15:39,836 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 12:15:39,836 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 12:15:39,837 INFO L87 Difference]: Start difference. First operand 77252 states and 87628 transitions. Second operand 3 states. [2018-09-18 12:15:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:42,107 INFO L93 Difference]: Finished difference Result 150511 states and 170712 transitions. [2018-09-18 12:15:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 12:15:42,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 871 [2018-09-18 12:15:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:42,273 INFO L225 Difference]: With dead ends: 150511 [2018-09-18 12:15:42,274 INFO L226 Difference]: Without dead ends: 73698 [2018-09-18 12:15:42,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1745 GetRequests, 1737 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 12:15:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73698 states. [2018-09-18 12:15:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73698 to 71087. [2018-09-18 12:15:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71087 states. [2018-09-18 12:15:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71087 states to 71087 states and 80531 transitions. [2018-09-18 12:15:43,155 INFO L78 Accepts]: Start accepts. Automaton has 71087 states and 80531 transitions. Word has length 871 [2018-09-18 12:15:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:43,155 INFO L480 AbstractCegarLoop]: Abstraction has 71087 states and 80531 transitions. [2018-09-18 12:15:43,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 12:15:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71087 states and 80531 transitions. [2018-09-18 12:15:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2018-09-18 12:15:43,241 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:43,242 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:15:43,242 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1467777062, now seen corresponding path program 1 times [2018-09-18 12:15:43,243 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:43,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:43,244 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2018-09-18 12:15:44,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 12:15:44,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 12:15:44,243 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 12:15:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 12:15:44,244 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 12:15:44,244 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 12:15:44,244 INFO L87 Difference]: Start difference. First operand 71087 states and 80531 transitions. Second operand 3 states. [2018-09-18 12:15:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:15:49,164 INFO L93 Difference]: Finished difference Result 143473 states and 162533 transitions. [2018-09-18 12:15:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 12:15:49,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 923 [2018-09-18 12:15:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:15:49,331 INFO L225 Difference]: With dead ends: 143473 [2018-09-18 12:15:49,331 INFO L226 Difference]: Without dead ends: 72827 [2018-09-18 12:15:49,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 12:15:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72827 states. [2018-09-18 12:15:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72827 to 72826. [2018-09-18 12:15:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72826 states. [2018-09-18 12:15:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72826 states to 72826 states and 82109 transitions. [2018-09-18 12:15:50,214 INFO L78 Accepts]: Start accepts. Automaton has 72826 states and 82109 transitions. Word has length 923 [2018-09-18 12:15:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:15:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 72826 states and 82109 transitions. [2018-09-18 12:15:50,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 12:15:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 72826 states and 82109 transitions. [2018-09-18 12:15:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2018-09-18 12:15:50,286 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:15:50,287 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 12:15:50,287 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:15:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash 151946235, now seen corresponding path program 1 times [2018-09-18 12:15:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:15:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:15:50,289 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:15:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 896 proven. 39 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-09-18 12:15:52,705 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:15:52,705 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-18 12:15:52,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:52,713 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:15:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:53,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:15:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 896 proven. 9 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-09-18 12:15:53,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:15:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 896 proven. 324 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-18 12:15:55,318 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:15:55,318 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-18 12:15:55,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:15:55,334 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:15:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:15:56,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:15:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 896 proven. 9 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-09-18 12:15:56,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:15:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 896 proven. 324 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-18 12:15:57,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 12:15:57,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 14 [2018-09-18 12:15:57,942 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 12:15:57,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 12:15:57,946 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 12:15:57,946 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-18 12:15:57,948 INFO L87 Difference]: Start difference. First operand 72826 states and 82109 transitions. Second operand 9 states. [2018-09-18 12:16:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 12:16:15,530 INFO L93 Difference]: Finished difference Result 175264 states and 200883 transitions. [2018-09-18 12:16:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-18 12:16:15,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1018 [2018-09-18 12:16:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 12:16:15,782 INFO L225 Difference]: With dead ends: 175264 [2018-09-18 12:16:15,782 INFO L226 Difference]: Without dead ends: 101999 [2018-09-18 12:16:15,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4113 GetRequests, 4079 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-18 12:16:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101999 states. [2018-09-18 12:16:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101999 to 94982. [2018-09-18 12:16:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94982 states. [2018-09-18 12:16:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94982 states to 94982 states and 107380 transitions. [2018-09-18 12:16:17,158 INFO L78 Accepts]: Start accepts. Automaton has 94982 states and 107380 transitions. Word has length 1018 [2018-09-18 12:16:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 12:16:17,159 INFO L480 AbstractCegarLoop]: Abstraction has 94982 states and 107380 transitions. [2018-09-18 12:16:17,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 12:16:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 94982 states and 107380 transitions. [2018-09-18 12:16:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-09-18 12:16:17,263 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 12:16:17,264 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 12:16:17,264 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 12:16:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 867535153, now seen corresponding path program 1 times [2018-09-18 12:16:17,265 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 12:16:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:16:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:16:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 12:16:17,266 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 12:16:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:16:18,272 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-18 12:16:18,561 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-18 12:16:18,894 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-18 12:16:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 313 proven. 659 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-09-18 12:16:21,354 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:16:21,354 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 12:16:21,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:16:21,363 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:16:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:16:21,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:16:23,701 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 Int)) (let ((.cse1 (* 9 v_prenex_9))) (let ((.cse0 (mod (div .cse1 10) 299849))) (and (= 0 .cse0) (<= c_~a28~0 (+ .cse0 300149)) (= (mod .cse1 10) 0))))) (exists ((v_~a28~0_1535 Int)) (let ((.cse2 (* 9 v_~a28~0_1535))) (let ((.cse3 (div .cse2 10))) (let ((.cse4 (mod .cse3 299849))) (and (= (mod .cse2 10) 0) (< .cse3 0) (not (= 0 .cse4)) (<= c_~a28~0 (+ .cse4 300))))))) (exists ((v_prenex_13 Int)) (let ((.cse6 (* 9 v_prenex_13))) (let ((.cse5 (mod (div .cse6 10) 299849))) (and (= 0 .cse5) (<= c_~a28~0 (+ .cse5 300149)) (<= 0 .cse6))))) (exists ((v_prenex_12 Int)) (let ((.cse8 (* 9 v_prenex_12))) (let ((.cse7 (+ (div .cse8 10) 1))) (and (<= c_~a28~0 (+ (mod .cse7 299849) 300149)) (<= 0 .cse7) (not (= (mod .cse8 10) 0)) (< .cse8 0))))) (exists ((v_prenex_16 Int)) (let ((.cse10 (* 9 v_prenex_16))) (let ((.cse9 (div .cse10 10))) (let ((.cse11 (mod .cse9 299849))) (and (< .cse9 0) (<= 0 .cse10) (not (= 0 .cse11)) (<= c_~a28~0 (+ .cse11 300))))))) (exists ((v_prenex_10 Int)) (let ((.cse12 (* 9 v_prenex_10))) (let ((.cse13 (div .cse12 10))) (and (= (mod .cse12 10) 0) (<= 0 .cse13) (<= c_~a28~0 (+ (mod .cse13 299849) 300149)))))) (exists ((v_prenex_15 Int)) (let ((.cse16 (* 9 v_prenex_15))) (let ((.cse15 (+ (div .cse16 10) 1))) (let ((.cse14 (mod .cse15 299849))) (and (not (= 0 .cse14)) (< .cse15 0) (not (= (mod .cse16 10) 0)) (< .cse16 0) (<= c_~a28~0 (+ .cse14 300))))))) (exists ((v_prenex_11 Int)) (let ((.cse18 (* 9 v_prenex_11))) (let ((.cse17 (mod (+ (div .cse18 10) 1) 299849))) (and (<= c_~a28~0 (+ .cse17 300149)) (= 0 .cse17) (< .cse18 0) (not (= (mod .cse18 10) 0)))))) (exists ((v_prenex_14 Int)) (let ((.cse20 (* 9 v_prenex_14))) (let ((.cse19 (div .cse20 10))) (and (<= 0 .cse19) (<= c_~a28~0 (+ (mod .cse19 299849) 300149)) (<= 0 .cse20)))))) is different from true [2018-09-18 12:16:25,982 WARN L178 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 113 DAG size of output: 16 [2018-09-18 12:16:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 866 proven. 55 refuted. 0 times theorem prover too weak. 549 trivial. 10 not checked. [2018-09-18 12:16:27,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:16:27,447 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-18 12:16:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 926 proven. 5 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-09-18 12:16:28,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 12:16:28,203 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 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 12:16:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 12:16:28,222 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 12:16:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 12:16:28,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 12:16:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 720 proven. 87 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2018-09-18 12:16:30,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 12:16:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 313 proven. 659 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-09-18 12:16:33,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 12:16:33,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6, 10, 11] total 38 [2018-09-18 12:16:33,211 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 12:16:33,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-18 12:16:33,212 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-18 12:16:33,213 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1143, Unknown=1, NotChecked=70, Total=1406 [2018-09-18 12:16:33,213 INFO L87 Difference]: Start difference. First operand 94982 states and 107380 transitions. Second operand 18 states. Received shutdown request... [2018-09-18 12:16:39,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-18 12:16:39,697 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-18 12:16:39,703 WARN L206 ceAbstractionStarter]: Timeout [2018-09-18 12:16:39,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 12:16:39 BoogieIcfgContainer [2018-09-18 12:16:39,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 12:16:39,704 INFO L168 Benchmark]: Toolchain (without parser) took 230777.85 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 329.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,705 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 12:16:39,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2071.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 307.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,707 INFO L168 Benchmark]: Boogie Preprocessor took 961.43 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 927.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,708 INFO L168 Benchmark]: RCFGBuilder took 11461.52 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 463.2 MB). Peak memory consumption was 463.2 MB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,708 INFO L168 Benchmark]: TraceAbstraction took 215969.93 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 1.9 GB in the beginning and 1.1 GB in the end (delta: 783.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-18 12:16:39,714 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2071.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 307.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 961.43 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 927.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11461.52 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 463.2 MB). Peak memory consumption was 463.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215969.93 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 1.9 GB in the beginning and 1.1 GB in the end (delta: 783.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 185]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 185). Cancelled while BasicCegarLoop was constructing difference of abstraction (94982states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 215.8s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 159.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7452 SDtfs, 31518 SDslu, 4028 SDs, 0 SdLazy, 53202 SolverSat, 10176 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 132.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14795 GetRequests, 14594 SyntacticMatches, 24 SemanticMatches, 176 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94982occurred in iteration=16, 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: 10.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 36579 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 15074 NumberOfCodeBlocks, 15074 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 22327 ConstructedInterpolants, 256 QuantifiedInterpolants, 59809611 SizeOfPredicates, 35 NumberOfNonLiveVariables, 10547 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 27349/30695 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/Problem17_label21_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_12-16-39-725.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label21_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_12-16-39-725.csv Completed graceful shutdown