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-dace188-m [2018-09-14 18:03:06,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 18:03:06,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 18:03:06,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 18:03:06,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 18:03:06,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 18:03:06,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 18:03:06,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 18:03:06,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 18:03:06,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 18:03:06,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 18:03:06,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 18:03:06,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 18:03:06,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 18:03:06,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 18:03:06,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 18:03:06,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 18:03:06,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 18:03:06,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 18:03:06,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 18:03:06,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 18:03:06,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 18:03:06,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 18:03:06,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 18:03:06,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 18:03:06,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 18:03:06,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 18:03:06,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 18:03:06,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 18:03:06,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 18:03:06,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 18:03:06,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 18:03:06,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 18:03:06,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 18:03:06,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 18:03:06,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 18:03:06,366 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 18:03:06,380 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 18:03:06,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 18:03:06,381 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 18:03:06,381 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 18:03:06,382 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 18:03:06,382 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 18:03:06,382 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 18:03:06,382 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 18:03:06,382 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 18:03:06,383 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 18:03:06,383 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 18:03:06,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 18:03:06,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 18:03:06,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 18:03:06,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 18:03:06,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 18:03:06,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 18:03:06,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 18:03:06,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 18:03:06,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 18:03:06,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 18:03:06,386 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 18:03:06,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 18:03:06,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 18:03:06,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 18:03:06,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 18:03:06,387 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 18:03:06,388 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 18:03:06,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 18:03:06,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 18:03:06,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 18:03:06,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 18:03:06,471 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 18:03:06,472 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-14 18:03:06,826 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711a842d8/0037260e45a8464180c810ee68be1387/FLAGeeb6547fb [2018-09-14 18:03:07,252 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 18:03:07,254 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-09-14 18:03:07,283 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711a842d8/0037260e45a8464180c810ee68be1387/FLAGeeb6547fb [2018-09-14 18:03:07,306 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/711a842d8/0037260e45a8464180c810ee68be1387 [2018-09-14 18:03:07,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 18:03:07,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 18:03:07,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 18:03:07,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 18:03:07,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 18:03:07,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:03:07" (1/1) ... [2018-09-14 18:03:07,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd6d764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:07, skipping insertion in model container [2018-09-14 18:03:07,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:03:07" (1/1) ... [2018-09-14 18:03:07,352 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 18:03:08,357 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:03:08,375 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 18:03:08,794 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:03:09,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09 WrapperNode [2018-09-14 18:03:09,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 18:03:09,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 18:03:09,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 18:03:09,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 18:03:09,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:09,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:09,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 18:03:09,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 18:03:09,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 18:03:09,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 18:03:09,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:09,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:09,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:09,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:10,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:10,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:10,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... [2018-09-14 18:03:10,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 18:03:10,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 18:03:10,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 18:03:10,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 18:03:10,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 18:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 18:03:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 18:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-14 18:03:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-14 18:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 18:03:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 18:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 18:03:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 18:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 18:03:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 18:03:25,877 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 18:03:25,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:03:25 BoogieIcfgContainer [2018-09-14 18:03:25,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 18:03:25,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 18:03:25,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 18:03:25,884 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 18:03:25,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 06:03:07" (1/3) ... [2018-09-14 18:03:25,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0309d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 06:03:25, skipping insertion in model container [2018-09-14 18:03:25,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:03:09" (2/3) ... [2018-09-14 18:03:25,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0309d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 06:03:25, skipping insertion in model container [2018-09-14 18:03:25,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:03:25" (3/3) ... [2018-09-14 18:03:25,888 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label21_true-unreach-call.c [2018-09-14 18:03:25,898 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 18:03:25,908 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 18:03:25,971 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 18:03:25,972 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 18:03:25,972 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 18:03:25,972 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 18:03:25,972 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 18:03:25,972 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 18:03:25,973 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 18:03:25,973 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 18:03:25,973 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 18:03:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-14 18:03:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-14 18:03:26,019 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:03:26,020 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-14 18:03:26,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:03:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1861558100, now seen corresponding path program 1 times [2018-09-14 18:03:26,028 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:03:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:03:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:26,077 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:03:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:03:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 18:03:26,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:03:26,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:03:26,627 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:03:26,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:03:26,650 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:03:26,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:03:26,653 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-09-14 18:03:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:03:36,901 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-09-14 18:03:36,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:03:36,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-09-14 18:03:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:03:36,945 INFO L225 Difference]: With dead ends: 2166 [2018-09-14 18:03:36,945 INFO L226 Difference]: Without dead ends: 1556 [2018-09-14 18:03:36,954 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-14 18:03:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-09-14 18:03:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-09-14 18:03:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-09-14 18:03:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-09-14 18:03:37,128 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 66 [2018-09-14 18:03:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:03:37,129 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-09-14 18:03:37,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:03:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-09-14 18:03:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-14 18:03:37,141 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:03:37,141 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-14 18:03:37,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:03:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash -436141222, now seen corresponding path program 1 times [2018-09-14 18:03:37,142 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:03:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:03:37,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:37,145 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:03:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:03:37,462 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-14 18:03:37,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:03:37,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 18:03:37,463 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:03:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 18:03:37,466 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 18:03:37,466 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:03:37,467 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-09-14 18:03:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:03:46,300 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-09-14 18:03:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 18:03:46,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-09-14 18:03:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:03:46,318 INFO L225 Difference]: With dead ends: 3059 [2018-09-14 18:03:46,319 INFO L226 Difference]: Without dead ends: 1997 [2018-09-14 18:03:46,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 18:03:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-09-14 18:03:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-09-14 18:03:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-09-14 18:03:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-09-14 18:03:46,400 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 142 [2018-09-14 18:03:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:03:46,401 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-09-14 18:03:46,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 18:03:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-09-14 18:03:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-14 18:03:46,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:03:46,413 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-14 18:03:46,416 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:03:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1261890222, now seen corresponding path program 1 times [2018-09-14 18:03:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:03:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:03:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:46,418 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:03:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:03:46,693 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-14 18:03:46,694 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:03:46,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 18:03:46,694 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:03:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 18:03:46,695 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 18:03:46,695 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:03:46,696 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-09-14 18:03:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:03:54,241 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-09-14 18:03:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 18:03:54,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-09-14 18:03:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:03:54,265 INFO L225 Difference]: With dead ends: 4880 [2018-09-14 18:03:54,265 INFO L226 Difference]: Without dead ends: 2911 [2018-09-14 18:03:54,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 18:03:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-09-14 18:03:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-09-14 18:03:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-09-14 18:03:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-09-14 18:03:54,369 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 146 [2018-09-14 18:03:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:03:54,373 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-09-14 18:03:54,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 18:03:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-09-14 18:03:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-14 18:03:54,379 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:03:54,379 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-14 18:03:54,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:03:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1548926097, now seen corresponding path program 1 times [2018-09-14 18:03:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:03:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:03:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:03:54,381 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:03:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:03:54,646 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-14 18:03:54,646 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:03:54,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:03:54,647 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:03:54,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:03:54,649 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:03:54,649 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:03:54,649 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-09-14 18:04:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:04:02,804 INFO L93 Difference]: Finished difference Result 6193 states and 8604 transitions. [2018-09-14 18:04:02,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:04:02,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-09-14 18:04:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:04:02,824 INFO L225 Difference]: With dead ends: 6193 [2018-09-14 18:04:02,824 INFO L226 Difference]: Without dead ends: 3319 [2018-09-14 18:04:02,835 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-14 18:04:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-09-14 18:04:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3319. [2018-09-14 18:04:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2018-09-14 18:04:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4442 transitions. [2018-09-14 18:04:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4442 transitions. Word has length 176 [2018-09-14 18:04:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:04:02,922 INFO L480 AbstractCegarLoop]: Abstraction has 3319 states and 4442 transitions. [2018-09-14 18:04:02,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:04:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4442 transitions. [2018-09-14 18:04:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-14 18:04:02,927 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:04:02,927 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-14 18:04:02,928 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:04:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -639298360, now seen corresponding path program 1 times [2018-09-14 18:04:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:04:02,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:02,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:02,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:02,929 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:04:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:03,332 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-14 18:04:03,333 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:04:03,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:04:03,333 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:04:03,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:04:03,334 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:04:03,336 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:04:03,336 INFO L87 Difference]: Start difference. First operand 3319 states and 4442 transitions. Second operand 4 states. [2018-09-14 18:04:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:04:12,694 INFO L93 Difference]: Finished difference Result 11927 states and 16176 transitions. [2018-09-14 18:04:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:04:12,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-09-14 18:04:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:04:12,741 INFO L225 Difference]: With dead ends: 11927 [2018-09-14 18:04:12,742 INFO L226 Difference]: Without dead ends: 8614 [2018-09-14 18:04:12,757 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-14 18:04:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2018-09-14 18:04:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 8610. [2018-09-14 18:04:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8610 states. [2018-09-14 18:04:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 10626 transitions. [2018-09-14 18:04:13,082 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 10626 transitions. Word has length 230 [2018-09-14 18:04:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:04:13,083 INFO L480 AbstractCegarLoop]: Abstraction has 8610 states and 10626 transitions. [2018-09-14 18:04:13,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:04:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 10626 transitions. [2018-09-14 18:04:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-14 18:04:13,091 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:04:13,091 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-14 18:04:13,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:04:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1380574037, now seen corresponding path program 1 times [2018-09-14 18:04:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:04:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:13,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:13,094 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:04:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:13,755 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-14 18:04:13,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:04:13,755 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 18:04:13,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:13,766 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:04:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:13,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:04:14,527 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-14 18:04:14,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:04:14,775 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-14 18:04:15,642 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-14 18:04:15,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 18:04:15,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 18:04:15,673 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:04:15,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 18:04:15,674 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 18:04:15,674 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-14 18:04:15,675 INFO L87 Difference]: Start difference. First operand 8610 states and 10626 transitions. Second operand 5 states. [2018-09-14 18:04:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:04:26,301 INFO L93 Difference]: Finished difference Result 20028 states and 24570 transitions. [2018-09-14 18:04:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 18:04:26,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2018-09-14 18:04:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:04:26,362 INFO L225 Difference]: With dead ends: 20028 [2018-09-14 18:04:26,363 INFO L226 Difference]: Without dead ends: 11424 [2018-09-14 18:04:26,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-14 18:04:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11424 states. [2018-09-14 18:04:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11424 to 11381. [2018-09-14 18:04:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11381 states. [2018-09-14 18:04:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11381 states to 11381 states and 13851 transitions. [2018-09-14 18:04:26,681 INFO L78 Accepts]: Start accepts. Automaton has 11381 states and 13851 transitions. Word has length 253 [2018-09-14 18:04:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:04:26,681 INFO L480 AbstractCegarLoop]: Abstraction has 11381 states and 13851 transitions. [2018-09-14 18:04:26,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 18:04:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11381 states and 13851 transitions. [2018-09-14 18:04:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-14 18:04:26,695 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:04:26,695 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-14 18:04:26,695 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:04:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash 757180591, now seen corresponding path program 1 times [2018-09-14 18:04:26,696 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:04:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:26,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:26,697 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:04:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:27,106 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-14 18:04:27,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:04:27,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:04:27,107 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:04:27,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:04:27,107 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:04:27,108 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:04:27,108 INFO L87 Difference]: Start difference. First operand 11381 states and 13851 transitions. Second operand 4 states. [2018-09-14 18:04:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:04:37,631 INFO L93 Difference]: Finished difference Result 29722 states and 36715 transitions. [2018-09-14 18:04:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:04:37,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-09-14 18:04:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:04:37,691 INFO L225 Difference]: With dead ends: 29722 [2018-09-14 18:04:37,692 INFO L226 Difference]: Without dead ends: 18347 [2018-09-14 18:04:37,764 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-14 18:04:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18347 states. [2018-09-14 18:04:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18347 to 18327. [2018-09-14 18:04:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18327 states. [2018-09-14 18:04:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18327 states to 18327 states and 21873 transitions. [2018-09-14 18:04:38,136 INFO L78 Accepts]: Start accepts. Automaton has 18327 states and 21873 transitions. Word has length 296 [2018-09-14 18:04:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:04:38,137 INFO L480 AbstractCegarLoop]: Abstraction has 18327 states and 21873 transitions. [2018-09-14 18:04:38,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:04:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18327 states and 21873 transitions. [2018-09-14 18:04:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-14 18:04:38,153 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:04:38,153 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-14 18:04:38,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:04:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1570509174, now seen corresponding path program 1 times [2018-09-14 18:04:38,154 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:04:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:38,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:04:38,156 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:04:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:38,930 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-09-14 18:04:39,176 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-14 18:04:39,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:04:39,177 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-14 18:04:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:39,189 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:04:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:39,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:04:39,737 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-09-14 18:04:40,186 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-14 18:04:40,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:04:41,609 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-09-14 18:04:42,169 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-14 18:04:42,200 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:04:42,200 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-14 18:04:42,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:04:42,221 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:04:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:04:42,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:04:42,841 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-14 18:04:42,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:04:43,894 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-14 18:04:43,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 18:04:43,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 7, 8] total 16 [2018-09-14 18:04:43,897 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 18:04:43,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 18:04:43,899 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 18:04:43,899 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-14 18:04:43,899 INFO L87 Difference]: Start difference. First operand 18327 states and 21873 transitions. Second operand 10 states. [2018-09-14 18:05:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:05:10,107 INFO L93 Difference]: Finished difference Result 55412 states and 69248 transitions. [2018-09-14 18:05:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-14 18:05:10,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2018-09-14 18:05:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:05:10,235 INFO L225 Difference]: With dead ends: 55412 [2018-09-14 18:05:10,235 INFO L226 Difference]: Without dead ends: 37091 [2018-09-14 18:05:10,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1214 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-09-14 18:05:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37091 states. [2018-09-14 18:05:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37091 to 35550. [2018-09-14 18:05:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2018-09-14 18:05:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 43726 transitions. [2018-09-14 18:05:11,028 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 43726 transitions. Word has length 305 [2018-09-14 18:05:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:05:11,029 INFO L480 AbstractCegarLoop]: Abstraction has 35550 states and 43726 transitions. [2018-09-14 18:05:11,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 18:05:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 43726 transitions. [2018-09-14 18:05:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-14 18:05:11,048 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:05:11,048 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-14 18:05:11,048 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:05:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1860730581, now seen corresponding path program 1 times [2018-09-14 18:05:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:05:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:11,050 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:05:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:11,510 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-09-14 18:05:11,593 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-14 18:05:11,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:05:11,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:05:11,594 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:05:11,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:05:11,595 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:05:11,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:05:11,595 INFO L87 Difference]: Start difference. First operand 35550 states and 43726 transitions. Second operand 4 states. [2018-09-14 18:05:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:05:21,879 INFO L93 Difference]: Finished difference Result 89177 states and 112008 transitions. [2018-09-14 18:05:21,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:05:21,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-09-14 18:05:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:05:22,052 INFO L225 Difference]: With dead ends: 89177 [2018-09-14 18:05:22,053 INFO L226 Difference]: Without dead ends: 54074 [2018-09-14 18:05:22,160 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-14 18:05:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54074 states. [2018-09-14 18:05:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54074 to 45606. [2018-09-14 18:05:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45606 states. [2018-09-14 18:05:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45606 states to 45606 states and 54653 transitions. [2018-09-14 18:05:23,558 INFO L78 Accepts]: Start accepts. Automaton has 45606 states and 54653 transitions. Word has length 328 [2018-09-14 18:05:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:05:23,559 INFO L480 AbstractCegarLoop]: Abstraction has 45606 states and 54653 transitions. [2018-09-14 18:05:23,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:05:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45606 states and 54653 transitions. [2018-09-14 18:05:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-14 18:05:23,590 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:05:23,590 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-14 18:05:23,591 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:05:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1332328749, now seen corresponding path program 1 times [2018-09-14 18:05:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:05:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:23,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:23,592 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:05:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:24,038 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-14 18:05:24,038 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:05:24,038 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-14 18:05:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:24,051 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:05:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:24,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:05:24,750 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-14 18:05:24,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:05:25,393 WARN L178 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-14 18:05:25,539 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-09-14 18:05:25,911 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-14 18:05:25,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:05:25,933 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-14 18:05:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:25,949 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:05:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:26,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:05:26,907 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-14 18:05:26,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:05:27,482 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-14 18:05:27,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 18:05:27,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 14 [2018-09-14 18:05:27,485 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 18:05:27,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 18:05:27,486 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 18:05:27,486 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-09-14 18:05:27,487 INFO L87 Difference]: Start difference. First operand 45606 states and 54653 transitions. Second operand 8 states. [2018-09-14 18:05:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:05:42,451 INFO L93 Difference]: Finished difference Result 124518 states and 150680 transitions. [2018-09-14 18:05:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-14 18:05:42,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 402 [2018-09-14 18:05:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:05:42,609 INFO L225 Difference]: With dead ends: 124518 [2018-09-14 18:05:42,610 INFO L226 Difference]: Without dead ends: 49123 [2018-09-14 18:05:42,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1660 GetRequests, 1620 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2018-09-14 18:05:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49123 states. [2018-09-14 18:05:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49123 to 44712. [2018-09-14 18:05:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44712 states. [2018-09-14 18:05:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44712 states to 44712 states and 51541 transitions. [2018-09-14 18:05:43,588 INFO L78 Accepts]: Start accepts. Automaton has 44712 states and 51541 transitions. Word has length 402 [2018-09-14 18:05:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:05:43,589 INFO L480 AbstractCegarLoop]: Abstraction has 44712 states and 51541 transitions. [2018-09-14 18:05:43,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 18:05:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 44712 states and 51541 transitions. [2018-09-14 18:05:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-09-14 18:05:43,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:05:43,611 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-14 18:05:43,611 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:05:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash -391628634, now seen corresponding path program 1 times [2018-09-14 18:05:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:05:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:43,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:43,612 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:05:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:44,018 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-14 18:05:44,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:05:44,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 18:05:44,019 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:05:44,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 18:05:44,019 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 18:05:44,019 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 18:05:44,020 INFO L87 Difference]: Start difference. First operand 44712 states and 51541 transitions. Second operand 3 states. [2018-09-14 18:05:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:05:48,459 INFO L93 Difference]: Finished difference Result 110181 states and 129079 transitions. [2018-09-14 18:05:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 18:05:48,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-09-14 18:05:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:05:48,662 INFO L225 Difference]: With dead ends: 110181 [2018-09-14 18:05:48,663 INFO L226 Difference]: Without dead ends: 64755 [2018-09-14 18:05:48,750 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-14 18:05:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64755 states. [2018-09-14 18:05:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64755 to 60831. [2018-09-14 18:05:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60831 states. [2018-09-14 18:05:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60831 states to 60831 states and 69761 transitions. [2018-09-14 18:05:50,291 INFO L78 Accepts]: Start accepts. Automaton has 60831 states and 69761 transitions. Word has length 461 [2018-09-14 18:05:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:05:50,292 INFO L480 AbstractCegarLoop]: Abstraction has 60831 states and 69761 transitions. [2018-09-14 18:05:50,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 18:05:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 60831 states and 69761 transitions. [2018-09-14 18:05:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-09-14 18:05:50,318 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:05:50,319 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-14 18:05:50,319 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:05:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash -67504576, now seen corresponding path program 1 times [2018-09-14 18:05:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:05:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:05:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:05:50,321 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:05:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:05:50,821 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-14 18:05:50,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:05:50,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:05:50,821 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:05:50,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:05:50,822 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:05:50,822 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:05:50,823 INFO L87 Difference]: Start difference. First operand 60831 states and 69761 transitions. Second operand 4 states. [2018-09-14 18:05:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:05:58,105 INFO L93 Difference]: Finished difference Result 144254 states and 166899 transitions. [2018-09-14 18:05:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:05:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 470 [2018-09-14 18:05:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:05:58,300 INFO L225 Difference]: With dead ends: 144254 [2018-09-14 18:05:58,300 INFO L226 Difference]: Without dead ends: 81609 [2018-09-14 18:05:58,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-14 18:05:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81609 states. [2018-09-14 18:06:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81609 to 75944. [2018-09-14 18:06:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75944 states. [2018-09-14 18:06:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75944 states to 75944 states and 86503 transitions. [2018-09-14 18:06:00,258 INFO L78 Accepts]: Start accepts. Automaton has 75944 states and 86503 transitions. Word has length 470 [2018-09-14 18:06:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:06:00,259 INFO L480 AbstractCegarLoop]: Abstraction has 75944 states and 86503 transitions. [2018-09-14 18:06:00,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:06:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75944 states and 86503 transitions. [2018-09-14 18:06:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-09-14 18:06:00,313 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:06:00,314 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-14 18:06:00,314 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:06:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1178967, now seen corresponding path program 1 times [2018-09-14 18:06:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:06:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:00,316 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:06:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:00,885 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-14 18:06:00,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:06:00,885 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 18:06:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:00,900 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:06:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:01,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:06:01,306 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-14 18:06:01,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:06:02,302 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-14 18:06:02,324 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 18:06:02,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-14 18:06:02,325 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:06:02,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 18:06:02,328 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 18:06:02,328 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 18:06:02,328 INFO L87 Difference]: Start difference. First operand 75944 states and 86503 transitions. Second operand 3 states. [2018-09-14 18:06:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:06:06,185 INFO L93 Difference]: Finished difference Result 154061 states and 175880 transitions. [2018-09-14 18:06:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 18:06:06,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2018-09-14 18:06:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:06:06,363 INFO L225 Difference]: With dead ends: 154061 [2018-09-14 18:06:06,363 INFO L226 Difference]: Without dead ends: 78558 [2018-09-14 18:06:06,448 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-14 18:06:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78558 states. [2018-09-14 18:06:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78558 to 76818. [2018-09-14 18:06:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76818 states. [2018-09-14 18:06:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76818 states to 76818 states and 87124 transitions. [2018-09-14 18:06:07,423 INFO L78 Accepts]: Start accepts. Automaton has 76818 states and 87124 transitions. Word has length 672 [2018-09-14 18:06:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:06:07,424 INFO L480 AbstractCegarLoop]: Abstraction has 76818 states and 87124 transitions. [2018-09-14 18:06:07,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 18:06:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 76818 states and 87124 transitions. [2018-09-14 18:06:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-09-14 18:06:07,499 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:06:07,500 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-14 18:06:07,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:06:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 314044229, now seen corresponding path program 1 times [2018-09-14 18:06:07,501 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:06:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:07,502 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:06:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:09,170 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-14 18:06:09,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:06:09,170 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-14 18:06:09,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:09,184 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:06:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:09,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:06:09,958 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-14 18:06:09,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:06:10,781 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-14 18:06:10,803 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 18:06:10,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-09-14 18:06:10,803 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:06:10,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 18:06:10,808 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 18:06:10,808 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:06:10,808 INFO L87 Difference]: Start difference. First operand 76818 states and 87124 transitions. Second operand 3 states. [2018-09-14 18:06:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:06:13,038 INFO L93 Difference]: Finished difference Result 149643 states and 169704 transitions. [2018-09-14 18:06:13,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 18:06:13,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 871 [2018-09-14 18:06:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:06:13,203 INFO L225 Difference]: With dead ends: 149643 [2018-09-14 18:06:13,203 INFO L226 Difference]: Without dead ends: 73264 [2018-09-14 18:06:13,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1745 GetRequests, 1737 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:06:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73264 states. [2018-09-14 18:06:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73264 to 70653. [2018-09-14 18:06:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70653 states. [2018-09-14 18:06:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70653 states to 70653 states and 80027 transitions. [2018-09-14 18:06:14,079 INFO L78 Accepts]: Start accepts. Automaton has 70653 states and 80027 transitions. Word has length 871 [2018-09-14 18:06:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:06:14,080 INFO L480 AbstractCegarLoop]: Abstraction has 70653 states and 80027 transitions. [2018-09-14 18:06:14,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 18:06:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 70653 states and 80027 transitions. [2018-09-14 18:06:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2018-09-14 18:06:14,168 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:06:14,169 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-14 18:06:14,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:06:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1467777062, now seen corresponding path program 1 times [2018-09-14 18:06:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:06:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:14,171 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:06:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:15,415 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-14 18:06:15,416 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:06:15,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 18:06:15,416 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:06:15,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 18:06:15,417 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 18:06:15,417 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 18:06:15,417 INFO L87 Difference]: Start difference. First operand 70653 states and 80027 transitions. Second operand 3 states. [2018-09-14 18:06:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:06:20,792 INFO L93 Difference]: Finished difference Result 142605 states and 161525 transitions. [2018-09-14 18:06:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 18:06:20,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 923 [2018-09-14 18:06:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:06:20,923 INFO L225 Difference]: With dead ends: 142605 [2018-09-14 18:06:20,924 INFO L226 Difference]: Without dead ends: 72393 [2018-09-14 18:06:21,000 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-14 18:06:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72393 states. [2018-09-14 18:06:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72393 to 72392. [2018-09-14 18:06:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72392 states. [2018-09-14 18:06:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72392 states to 72392 states and 81605 transitions. [2018-09-14 18:06:21,790 INFO L78 Accepts]: Start accepts. Automaton has 72392 states and 81605 transitions. Word has length 923 [2018-09-14 18:06:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:06:21,791 INFO L480 AbstractCegarLoop]: Abstraction has 72392 states and 81605 transitions. [2018-09-14 18:06:21,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 18:06:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 72392 states and 81605 transitions. [2018-09-14 18:06:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2018-09-14 18:06:21,868 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:06:21,868 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-14 18:06:21,869 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:06:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash 151946235, now seen corresponding path program 1 times [2018-09-14 18:06:21,869 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:06:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:21,870 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:06:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:24,124 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-14 18:06:24,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:06:24,124 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 18:06:24,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:24,133 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:06:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:24,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:06:25,714 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-14 18:06:25,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:06:26,972 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-14 18:06:26,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:06:26,995 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 18:06:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:27,011 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:06:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:27,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:06:28,410 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-14 18:06:28,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:06:29,634 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-14 18:06:29,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 18:06:29,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 14 [2018-09-14 18:06:29,637 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 18:06:29,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 18:06:29,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 18:06:29,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-14 18:06:29,639 INFO L87 Difference]: Start difference. First operand 72392 states and 81605 transitions. Second operand 9 states. [2018-09-14 18:06:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:06:51,461 INFO L93 Difference]: Finished difference Result 174386 states and 199803 transitions. [2018-09-14 18:06:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-14 18:06:51,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1018 [2018-09-14 18:06:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:06:51,731 INFO L225 Difference]: With dead ends: 174386 [2018-09-14 18:06:51,732 INFO L226 Difference]: Without dead ends: 101555 [2018-09-14 18:06:51,836 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-14 18:06:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101555 states. [2018-09-14 18:06:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101555 to 94982. [2018-09-14 18:06:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94982 states. [2018-09-14 18:06:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94982 states to 94982 states and 107380 transitions. [2018-09-14 18:06:53,350 INFO L78 Accepts]: Start accepts. Automaton has 94982 states and 107380 transitions. Word has length 1018 [2018-09-14 18:06:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:06:53,351 INFO L480 AbstractCegarLoop]: Abstraction has 94982 states and 107380 transitions. [2018-09-14 18:06:53,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 18:06:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 94982 states and 107380 transitions. [2018-09-14 18:06:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-09-14 18:06:53,459 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:06:53,460 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-14 18:06:53,460 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:06:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 867535153, now seen corresponding path program 1 times [2018-09-14 18:06:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:06:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:53,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:06:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:06:53,462 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:06:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:06:54,225 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 Received shutdown request... [2018-09-14 18:06:54,287 WARN L186 SmtUtils]: Removed 3 from assertion stack [2018-09-14 18:06:54,288 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 18:06:54,295 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 18:06:54,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 06:06:54 BoogieIcfgContainer [2018-09-14 18:06:54,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 18:06:54,298 INFO L168 Benchmark]: Toolchain (without parser) took 226978.70 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -197.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-14 18:06:54,300 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 18:06:54,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1680.95 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: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-09-14 18:06:54,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 346.63 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2018-09-14 18:06:54,304 INFO L168 Benchmark]: Boogie Preprocessor took 918.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 923.8 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-14 18:06:54,308 INFO L168 Benchmark]: RCFGBuilder took 15607.41 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 457.1 MB). Peak memory consumption was 457.1 MB. Max. memory is 7.1 GB. [2018-09-14 18:06:54,309 INFO L168 Benchmark]: TraceAbstraction took 208415.92 ms. Allocated memory was 2.4 GB in the beginning and 3.5 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 279.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-14 18:06:54,323 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1680.95 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: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 346.63 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 918.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 923.8 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 15607.41 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 457.1 MB). Peak memory consumption was 457.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208415.92 ms. Allocated memory was 2.4 GB in the beginning and 3.5 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 279.2 MB). Peak memory consumption was 1.4 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 analyzing trace of length 1024 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 208.3s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 164.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7433 SDtfs, 26202 SDslu, 4035 SDs, 0 SdLazy, 52725 SolverSat, 10044 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 139.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10678 GetRequests, 10525 SyntacticMatches, 21 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 8.5s 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: 11.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 35542 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 12005 NumberOfCodeBlocks, 12005 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 17217 ConstructedInterpolants, 186 QuantifiedInterpolants, 30839999 SizeOfPredicates, 20 NumberOfNonLiveVariables, 7779 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 21424/23295 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-14_18-06-54-352.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-14_18-06-54-352.csv Completed graceful shutdown