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/Problem11_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 11:26:34,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 11:26:34,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 11:26:34,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 11:26:34,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 11:26:34,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 11:26:34,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 11:26:34,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 11:26:34,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 11:26:34,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 11:26:34,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 11:26:34,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 11:26:34,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 11:26:34,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 11:26:34,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 11:26:34,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 11:26:34,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 11:26:34,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 11:26:34,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 11:26:34,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 11:26:34,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 11:26:34,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 11:26:34,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 11:26:34,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 11:26:34,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 11:26:34,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 11:26:34,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 11:26:34,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 11:26:34,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 11:26:34,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 11:26:34,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 11:26:34,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 11:26:34,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 11:26:34,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 11:26:34,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 11:26:34,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 11:26:34,530 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-18 11:26:34,558 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 11:26:34,558 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 11:26:34,559 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 11:26:34,559 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 11:26:34,560 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 11:26:34,560 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 11:26:34,560 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 11:26:34,560 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 11:26:34,560 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 11:26:34,561 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 11:26:34,561 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 11:26:34,561 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 11:26:34,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 11:26:34,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 11:26:34,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 11:26:34,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 11:26:34,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 11:26:34,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 11:26:34,565 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 11:26:34,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 11:26:34,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 11:26:34,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 11:26:34,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 11:26:34,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 11:26:34,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 11:26:34,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 11:26:34,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 11:26:34,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 11:26:34,567 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 11:26:34,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 11:26:34,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 11:26:34,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 11:26:34,568 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 11:26:34,568 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 11:26:34,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 11:26:34,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 11:26:34,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 11:26:34,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 11:26:34,666 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 11:26:34,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label56_true-unreach-call.c [2018-09-18 11:26:35,023 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76422c20b/03dc4a56085749d8ae553142e06dbea1/FLAG7f1bb66e5 [2018-09-18 11:26:35,346 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 11:26:35,351 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label56_true-unreach-call.c [2018-09-18 11:26:35,374 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76422c20b/03dc4a56085749d8ae553142e06dbea1/FLAG7f1bb66e5 [2018-09-18 11:26:35,391 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76422c20b/03dc4a56085749d8ae553142e06dbea1 [2018-09-18 11:26:35,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 11:26:35,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 11:26:35,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 11:26:35,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 11:26:35,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 11:26:35,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:26:35" (1/1) ... [2018-09-18 11:26:35,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54423241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:35, skipping insertion in model container [2018-09-18 11:26:35,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:26:35" (1/1) ... [2018-09-18 11:26:35,432 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 11:26:36,115 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:26:36,133 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 11:26:36,309 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:26:36,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36 WrapperNode [2018-09-18 11:26:36,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 11:26:36,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 11:26:36,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 11:26:36,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 11:26:36,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 11:26:36,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 11:26:36,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 11:26:36,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 11:26:36,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... [2018-09-18 11:26:36,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 11:26:36,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 11:26:36,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 11:26:36,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 11:26:36,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 11:26:37,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 11:26:37,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 11:26:37,052 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 11:26:37,053 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 11:26:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 11:26:37,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 11:26:37,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 11:26:37,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 11:26:41,315 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 11:26:41,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:26:41 BoogieIcfgContainer [2018-09-18 11:26:41,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 11:26:41,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 11:26:41,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 11:26:41,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 11:26:41,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 11:26:35" (1/3) ... [2018-09-18 11:26:41,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2e5952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:26:41, skipping insertion in model container [2018-09-18 11:26:41,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:26:36" (2/3) ... [2018-09-18 11:26:41,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2e5952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:26:41, skipping insertion in model container [2018-09-18 11:26:41,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:26:41" (3/3) ... [2018-09-18 11:26:41,324 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label56_true-unreach-call.c [2018-09-18 11:26:41,334 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 11:26:41,342 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 11:26:41,395 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 11:26:41,395 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 11:26:41,396 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 11:26:41,396 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 11:26:41,396 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 11:26:41,396 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 11:26:41,396 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 11:26:41,396 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 11:26:41,396 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 11:26:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-18 11:26:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-18 11:26:41,435 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:26:41,436 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] [2018-09-18 11:26:41,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:26:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash -822687572, now seen corresponding path program 1 times [2018-09-18 11:26:41,446 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:26:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:41,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:41,494 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:26:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:41,853 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 11:26:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:26:41,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:26:41,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 11:26:41,975 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:26:41,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:26:41,997 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:26:41,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:26:42,000 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-09-18 11:26:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:26:44,282 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-09-18 11:26:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:26:44,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-09-18 11:26:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:26:44,305 INFO L225 Difference]: With dead ends: 782 [2018-09-18 11:26:44,305 INFO L226 Difference]: Without dead ends: 487 [2018-09-18 11:26:44,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:26:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-09-18 11:26:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-09-18 11:26:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-09-18 11:26:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 843 transitions. [2018-09-18 11:26:44,404 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 843 transitions. Word has length 48 [2018-09-18 11:26:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:26:44,405 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 843 transitions. [2018-09-18 11:26:44,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:26:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 843 transitions. [2018-09-18 11:26:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-18 11:26:44,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:26:44,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 11:26:44,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:26:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -191480489, now seen corresponding path program 1 times [2018-09-18 11:26:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:26:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:44,417 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:26:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:26:45,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:26:45,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-18 11:26:45,139 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:26:45,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 11:26:45,142 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 11:26:45,142 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-18 11:26:45,142 INFO L87 Difference]: Start difference. First operand 482 states and 843 transitions. Second operand 7 states. [2018-09-18 11:26:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:26:52,791 INFO L93 Difference]: Finished difference Result 1760 states and 3239 transitions. [2018-09-18 11:26:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-18 11:26:52,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-09-18 11:26:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:26:52,810 INFO L225 Difference]: With dead ends: 1760 [2018-09-18 11:26:52,810 INFO L226 Difference]: Without dead ends: 1284 [2018-09-18 11:26:52,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:26:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-09-18 11:26:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1037. [2018-09-18 11:26:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-09-18 11:26:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1685 transitions. [2018-09-18 11:26:52,912 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1685 transitions. Word has length 123 [2018-09-18 11:26:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:26:52,913 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1685 transitions. [2018-09-18 11:26:52,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 11:26:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1685 transitions. [2018-09-18 11:26:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-18 11:26:52,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:26:52,924 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:26:52,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:26:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -259626392, now seen corresponding path program 1 times [2018-09-18 11:26:52,927 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:26:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:52,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:52,929 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:26:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 82 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 11:26:53,274 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:26:53,274 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:26:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:53,287 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:26:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:53,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:26:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-18 11:26:53,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:26:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 82 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 11:26:54,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:26:54,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:26:54,150 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:26:54,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:26:54,152 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:26:54,152 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:26:54,152 INFO L87 Difference]: Start difference. First operand 1037 states and 1685 transitions. Second operand 5 states. [2018-09-18 11:27:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:27:00,687 INFO L93 Difference]: Finished difference Result 3395 states and 5619 transitions. [2018-09-18 11:27:00,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 11:27:00,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2018-09-18 11:27:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:27:00,707 INFO L225 Difference]: With dead ends: 3395 [2018-09-18 11:27:00,708 INFO L226 Difference]: Without dead ends: 2364 [2018-09-18 11:27:00,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-18 11:27:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-09-18 11:27:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2323. [2018-09-18 11:27:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-09-18 11:27:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3627 transitions. [2018-09-18 11:27:00,799 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3627 transitions. Word has length 196 [2018-09-18 11:27:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:27:00,800 INFO L480 AbstractCegarLoop]: Abstraction has 2323 states and 3627 transitions. [2018-09-18 11:27:00,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:27:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3627 transitions. [2018-09-18 11:27:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-18 11:27:00,807 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:27:00,807 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:27:00,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:27:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 188115406, now seen corresponding path program 1 times [2018-09-18 11:27:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:27:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:00,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:00,810 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:27:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 11:27:01,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:27:01,216 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:27:01,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:01,226 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:27:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:01,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:27:03,593 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_24 Int)) (let ((.cse0 (div v_prenex_24 5))) (let ((.cse1 (mod .cse0 90))) (and (< .cse0 0) (<= |c_old(~a23~0)| v_prenex_24) (= 0 (mod v_prenex_24 5)) (= (mod (+ .cse0 1) 90) 0) (<= (+ c_~a23~0 41) .cse1) (not (= 0 .cse1)))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (div v_prenex_18 5))) (let ((.cse2 (+ .cse3 1))) (and (<= c_~a23~0 (+ (mod .cse2 90) 49)) (<= 0 .cse2) (< v_prenex_18 0) (<= |c_old(~a23~0)| v_prenex_18) (not (= 0 (mod v_prenex_18 5))) (<= 0 .cse3))))) (exists ((v_prenex_13 Int)) (let ((.cse5 (div v_prenex_13 5))) (let ((.cse4 (mod .cse5 90))) (and (= 0 .cse4) (<= |c_old(~a23~0)| v_prenex_13) (= 0 (mod v_prenex_13 5)) (<= 0 (+ .cse5 1)) (<= c_~a23~0 (+ .cse4 49)))))) (exists ((v_prenex_8 Int)) (let ((.cse6 (div v_prenex_8 5))) (and (<= 0 v_prenex_8) (= (mod (+ .cse6 1) 90) 0) (<= 0 .cse6) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod .cse6 90) 49))))) (exists ((v_prenex_17 Int)) (let ((.cse9 (div v_prenex_17 5))) (let ((.cse8 (+ .cse9 1))) (let ((.cse7 (mod .cse8 90))) (and (< v_prenex_17 0) (<= (+ c_~a23~0 41) .cse7) (< .cse8 0) (<= |c_old(~a23~0)| v_prenex_17) (not (= 0 (mod v_prenex_17 5))) (= 0 (mod .cse9 90)) (not (= .cse7 0))))))) (exists ((v_prenex_4 Int)) (let ((.cse11 (div v_prenex_4 5))) (let ((.cse10 (mod (+ .cse11 1) 90))) (and (= .cse10 0) (< v_prenex_4 0) (<= c_~a23~0 (+ .cse10 49)) (= 0 (mod .cse11 90)) (not (= 0 (mod v_prenex_4 5))) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_26 Int)) (let ((.cse12 (div v_prenex_26 5))) (let ((.cse13 (mod .cse12 90))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse12 1)) (<= 0 v_prenex_26) (= 0 .cse13) (<= c_~a23~0 (+ .cse13 49)))))) (exists ((v_prenex_3 Int)) (let ((.cse14 (div v_prenex_3 5))) (let ((.cse15 (+ .cse14 1))) (and (<= c_~a23~0 (+ (mod .cse14 90) 49)) (<= 0 v_prenex_3) (<= 0 .cse14) (not (= (mod .cse15 90) 0)) (<= |c_old(~a23~0)| v_prenex_3) (< .cse15 0))))) (exists ((v_prenex_6 Int)) (let ((.cse17 (div v_prenex_6 5))) (let ((.cse16 (mod .cse17 90))) (and (= 0 .cse16) (<= c_~a23~0 (+ .cse16 49)) (= (mod (+ .cse17 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_6) (<= 0 v_prenex_6))))) (exists ((v_prenex_11 Int)) (let ((.cse18 (div v_prenex_11 5))) (let ((.cse19 (mod .cse18 90)) (.cse20 (+ .cse18 1))) (and (< .cse18 0) (<= (+ c_~a23~0 41) .cse19) (not (= 0 .cse19)) (<= |c_old(~a23~0)| v_prenex_11) (<= 0 v_prenex_11) (not (= (mod .cse20 90) 0)) (< .cse20 0))))) (exists ((v_prenex_14 Int)) (let ((.cse22 (div v_prenex_14 5))) (let ((.cse21 (mod .cse22 90))) (and (<= (+ c_~a23~0 41) .cse21) (<= |c_old(~a23~0)| v_prenex_14) (<= 0 (+ .cse22 1)) (not (= 0 .cse21)) (< .cse22 0) (<= 0 v_prenex_14))))) (exists ((v_~a23~0_492 Int)) (let ((.cse24 (div v_~a23~0_492 5))) (let ((.cse23 (+ .cse24 1))) (let ((.cse25 (mod .cse23 90))) (and (< .cse23 0) (<= 0 .cse24) (< v_~a23~0_492 0) (<= |c_old(~a23~0)| v_~a23~0_492) (<= (+ c_~a23~0 41) .cse25) (not (= .cse25 0)) (not (= 0 (mod v_~a23~0_492 5)))))))) (exists ((v_prenex_19 Int)) (let ((.cse26 (div v_prenex_19 5))) (let ((.cse27 (mod .cse26 90)) (.cse28 (+ .cse26 1))) (and (< .cse26 0) (not (= 0 .cse27)) (<= (+ c_~a23~0 41) .cse27) (= 0 (mod v_prenex_19 5)) (< .cse28 0) (not (= (mod .cse28 90) 0)) (<= |c_old(~a23~0)| v_prenex_19))))) (exists ((v_prenex_22 Int)) (let ((.cse29 (div v_prenex_22 5))) (and (<= |c_old(~a23~0)| v_prenex_22) (<= 0 .cse29) (<= 0 (+ .cse29 1)) (<= 0 v_prenex_22) (<= c_~a23~0 (+ (mod .cse29 90) 49))))) (exists ((v_prenex_5 Int)) (let ((.cse31 (div v_prenex_5 5))) (let ((.cse30 (mod .cse31 90))) (and (<= (+ c_~a23~0 41) .cse30) (< .cse31 0) (<= 0 v_prenex_5) (= (mod (+ .cse31 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_5) (not (= 0 .cse30)))))) (exists ((v_prenex_20 Int)) (let ((.cse33 (div v_prenex_20 5))) (let ((.cse32 (+ .cse33 1))) (and (<= c_~a23~0 (+ (mod .cse32 90) 49)) (< v_prenex_20 0) (<= |c_old(~a23~0)| v_prenex_20) (not (= 0 (mod v_prenex_20 5))) (= 0 (mod .cse33 90)) (<= 0 .cse32))))) (exists ((v_prenex_15 Int)) (let ((.cse34 (div v_prenex_15 5))) (let ((.cse35 (+ .cse34 1))) (and (<= 0 .cse34) (<= c_~a23~0 (+ (mod .cse34 90) 49)) (<= |c_old(~a23~0)| v_prenex_15) (< .cse35 0) (= 0 (mod v_prenex_15 5)) (not (= (mod .cse35 90) 0)))))) (exists ((v_prenex_16 Int)) (let ((.cse37 (div v_prenex_16 5))) (let ((.cse36 (mod .cse37 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= c_~a23~0 (+ .cse36 49)) (= 0 (mod v_prenex_16 5)) (= (mod (+ .cse37 1) 90) 0) (= 0 .cse36))))) (exists ((v_prenex_23 Int)) (let ((.cse39 (div v_prenex_23 5))) (let ((.cse38 (mod .cse39 90))) (and (not (= 0 .cse38)) (<= |c_old(~a23~0)| v_prenex_23) (<= (+ c_~a23~0 41) .cse38) (= 0 (mod v_prenex_23 5)) (< .cse39 0) (<= 0 (+ .cse39 1)))))) (exists ((v_prenex_9 Int)) (let ((.cse41 (div v_prenex_9 5))) (let ((.cse40 (mod (+ .cse41 1) 90))) (and (<= |c_old(~a23~0)| v_prenex_9) (= .cse40 0) (< v_prenex_9 0) (< .cse41 0) (<= c_~a23~0 (+ .cse40 49)) (not (= 0 (mod .cse41 90))) (not (= 0 (mod v_prenex_9 5))))))) (exists ((v_prenex_7 Int)) (let ((.cse44 (div v_prenex_7 5))) (let ((.cse42 (+ .cse44 1)) (.cse43 (mod .cse44 90))) (and (= 0 (mod v_prenex_7 5)) (not (= (mod .cse42 90) 0)) (= 0 .cse43) (< .cse42 0) (<= |c_old(~a23~0)| v_prenex_7) (<= c_~a23~0 (+ .cse43 49)))))) (exists ((v_prenex_1 Int)) (let ((.cse45 (div v_prenex_1 5))) (and (<= 0 (+ .cse45 1)) (<= c_~a23~0 (+ (mod .cse45 90) 49)) (= 0 (mod v_prenex_1 5)) (<= 0 .cse45) (<= |c_old(~a23~0)| v_prenex_1)))) (exists ((v_prenex_2 Int)) (let ((.cse46 (div v_prenex_2 5))) (let ((.cse48 (+ .cse46 1))) (let ((.cse47 (mod .cse48 90))) (and (not (= 0 (mod .cse46 90))) (<= |c_old(~a23~0)| v_prenex_2) (not (= .cse47 0)) (<= (+ c_~a23~0 41) .cse47) (< v_prenex_2 0) (< .cse48 0) (< .cse46 0) (not (= 0 (mod v_prenex_2 5)))))))) (exists ((v_prenex_10 Int)) (let ((.cse51 (div v_prenex_10 5))) (let ((.cse50 (+ .cse51 1)) (.cse49 (mod .cse51 90))) (and (= 0 .cse49) (<= 0 v_prenex_10) (not (= (mod .cse50 90) 0)) (< .cse50 0) (<= c_~a23~0 (+ .cse49 49)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (div v_prenex_25 5))) (let ((.cse52 (mod (+ .cse53 1) 90))) (and (not (= 0 (mod v_prenex_25 5))) (< v_prenex_25 0) (<= c_~a23~0 (+ .cse52 49)) (<= |c_old(~a23~0)| v_prenex_25) (<= 0 .cse53) (= .cse52 0))))) (exists ((v_prenex_12 Int)) (let ((.cse54 (div v_prenex_12 5))) (let ((.cse55 (+ .cse54 1))) (and (<= |c_old(~a23~0)| v_prenex_12) (< .cse54 0) (<= 0 .cse55) (<= c_~a23~0 (+ (mod .cse55 90) 49)) (not (= 0 (mod v_prenex_12 5))) (not (= 0 (mod .cse54 90))) (< v_prenex_12 0))))) (exists ((v_prenex_21 Int)) (let ((.cse56 (div v_prenex_21 5))) (and (<= 0 .cse56) (= (mod (+ .cse56 1) 90) 0) (= 0 (mod v_prenex_21 5)) (<= |c_old(~a23~0)| v_prenex_21) (<= c_~a23~0 (+ (mod .cse56 90) 49)))))) is different from true [2018-09-18 11:27:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 72 trivial. 2 not checked. [2018-09-18 11:27:04,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:27:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 11:27:04,625 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:27:04,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2018-09-18 11:27:04,625 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:27:04,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:27:04,626 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:27:04,629 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:27:04,629 INFO L87 Difference]: Start difference. First operand 2323 states and 3627 transitions. Second operand 3 states. [2018-09-18 11:27:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:27:06,153 INFO L93 Difference]: Finished difference Result 6306 states and 10212 transitions. [2018-09-18 11:27:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:27:06,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-09-18 11:27:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:27:06,183 INFO L225 Difference]: With dead ends: 6306 [2018-09-18 11:27:06,183 INFO L226 Difference]: Without dead ends: 3989 [2018-09-18 11:27:06,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 479 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:27:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2018-09-18 11:27:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3955. [2018-09-18 11:27:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2018-09-18 11:27:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 6081 transitions. [2018-09-18 11:27:06,302 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 6081 transitions. Word has length 240 [2018-09-18 11:27:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:27:06,303 INFO L480 AbstractCegarLoop]: Abstraction has 3955 states and 6081 transitions. [2018-09-18 11:27:06,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:27:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 6081 transitions. [2018-09-18 11:27:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-18 11:27:06,314 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:27:06,315 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:27:06,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:27:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash 764806318, now seen corresponding path program 1 times [2018-09-18 11:27:06,315 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:27:06,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:06,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:06,317 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:27:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:27:06,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:27:06,890 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:27:06,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:06,898 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:27:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:06,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:27:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:27:07,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:27:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:27:07,788 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:27:07,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:27:07,789 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:27:07,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:27:07,791 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:27:07,791 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:27:07,792 INFO L87 Difference]: Start difference. First operand 3955 states and 6081 transitions. Second operand 5 states. [2018-09-18 11:27:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:27:10,460 INFO L93 Difference]: Finished difference Result 10588 states and 16598 transitions. [2018-09-18 11:27:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 11:27:10,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2018-09-18 11:27:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:27:10,506 INFO L225 Difference]: With dead ends: 10588 [2018-09-18 11:27:10,507 INFO L226 Difference]: Without dead ends: 6639 [2018-09-18 11:27:10,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 506 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:27:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2018-09-18 11:27:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6588. [2018-09-18 11:27:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6588 states. [2018-09-18 11:27:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9121 transitions. [2018-09-18 11:27:10,733 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9121 transitions. Word has length 256 [2018-09-18 11:27:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:27:10,734 INFO L480 AbstractCegarLoop]: Abstraction has 6588 states and 9121 transitions. [2018-09-18 11:27:10,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:27:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9121 transitions. [2018-09-18 11:27:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-18 11:27:10,760 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:27:10,760 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:27:10,761 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:27:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1316171772, now seen corresponding path program 1 times [2018-09-18 11:27:10,761 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:27:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:10,762 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:27:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:27:11,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:27:11,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 11:27:11,045 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:27:11,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 11:27:11,046 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 11:27:11,046 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 11:27:11,046 INFO L87 Difference]: Start difference. First operand 6588 states and 9121 transitions. Second operand 4 states. [2018-09-18 11:27:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:27:13,499 INFO L93 Difference]: Finished difference Result 22722 states and 33555 transitions. [2018-09-18 11:27:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 11:27:13,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2018-09-18 11:27:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:27:13,596 INFO L225 Difference]: With dead ends: 22722 [2018-09-18 11:27:13,596 INFO L226 Difference]: Without dead ends: 16140 [2018-09-18 11:27:13,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 11:27:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16140 states. [2018-09-18 11:27:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16140 to 15912. [2018-09-18 11:27:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15912 states. [2018-09-18 11:27:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15912 states to 15912 states and 22198 transitions. [2018-09-18 11:27:14,329 INFO L78 Accepts]: Start accepts. Automaton has 15912 states and 22198 transitions. Word has length 271 [2018-09-18 11:27:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:27:14,329 INFO L480 AbstractCegarLoop]: Abstraction has 15912 states and 22198 transitions. [2018-09-18 11:27:14,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 11:27:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 15912 states and 22198 transitions. [2018-09-18 11:27:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-18 11:27:14,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:27:14,393 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:27:14,393 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:27:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash 385643921, now seen corresponding path program 1 times [2018-09-18 11:27:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:27:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:14,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:27:14,395 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:27:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 87 proven. 101 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-18 11:27:14,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:27:14,910 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:27:14,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:14,919 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:27:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:15,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:27:20,094 WARN L178 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-09-18 11:27:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-09-18 11:27:20,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:27:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:27:20,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:27:20,533 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:27:20,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:27:20,550 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:27:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:27:20,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:27:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 83 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:27:22,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:27:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:27:22,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:27:22,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5, 8, 5] total 15 [2018-09-18 11:27:22,813 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:27:22,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-18 11:27:22,814 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-18 11:27:22,815 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=147, Unknown=3, NotChecked=0, Total=210 [2018-09-18 11:27:22,815 INFO L87 Difference]: Start difference. First operand 15912 states and 22198 transitions. Second operand 10 states. [2018-09-18 11:27:30,975 WARN L178 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-09-18 11:28:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:14,223 INFO L93 Difference]: Finished difference Result 45560 states and 71236 transitions. [2018-09-18 11:28:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-18 11:28:14,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-18 11:28:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:14,433 INFO L225 Difference]: With dead ends: 45560 [2018-09-18 11:28:14,434 INFO L226 Difference]: Without dead ends: 29654 [2018-09-18 11:28:14,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1144 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=232, Invalid=634, Unknown=4, NotChecked=0, Total=870 [2018-09-18 11:28:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29654 states. [2018-09-18 11:28:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29654 to 28304. [2018-09-18 11:28:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28304 states. [2018-09-18 11:28:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28304 states to 28304 states and 41868 transitions. [2018-09-18 11:28:15,660 INFO L78 Accepts]: Start accepts. Automaton has 28304 states and 41868 transitions. Word has length 289 [2018-09-18 11:28:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:15,661 INFO L480 AbstractCegarLoop]: Abstraction has 28304 states and 41868 transitions. [2018-09-18 11:28:15,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-18 11:28:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 28304 states and 41868 transitions. [2018-09-18 11:28:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-18 11:28:15,727 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:15,727 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:28:15,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:15,728 INFO L82 PathProgramCache]: Analyzing trace with hash -17305994, now seen corresponding path program 1 times [2018-09-18 11:28:15,728 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:15,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:15,730 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:16,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:16,487 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:16,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:16,500 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:16,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:28:17,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:28:17,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:17,183 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:28:17,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:17,199 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:17,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:28:17,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:28:17,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:28:17,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 15 [2018-09-18 11:28:17,731 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:28:17,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-18 11:28:17,732 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-18 11:28:17,732 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-09-18 11:28:17,733 INFO L87 Difference]: Start difference. First operand 28304 states and 41868 transitions. Second operand 8 states. [2018-09-18 11:28:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:28,025 INFO L93 Difference]: Finished difference Result 63205 states and 131586 transitions. [2018-09-18 11:28:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-18 11:28:28,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 303 [2018-09-18 11:28:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:28,454 INFO L225 Difference]: With dead ends: 63205 [2018-09-18 11:28:28,455 INFO L226 Difference]: Without dead ends: 35096 [2018-09-18 11:28:28,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1224 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=480, Invalid=2070, Unknown=0, NotChecked=0, Total=2550 [2018-09-18 11:28:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35096 states. [2018-09-18 11:28:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35096 to 32420. [2018-09-18 11:28:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32420 states. [2018-09-18 11:28:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32420 states to 32420 states and 47400 transitions. [2018-09-18 11:28:31,069 INFO L78 Accepts]: Start accepts. Automaton has 32420 states and 47400 transitions. Word has length 303 [2018-09-18 11:28:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:31,070 INFO L480 AbstractCegarLoop]: Abstraction has 32420 states and 47400 transitions. [2018-09-18 11:28:31,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-18 11:28:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32420 states and 47400 transitions. [2018-09-18 11:28:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-18 11:28:31,195 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:31,196 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 11:28:31,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1725009270, now seen corresponding path program 1 times [2018-09-18 11:28:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:31,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:31,199 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-09-18 11:28:31,475 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:31,475 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:31,486 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:31,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-09-18 11:28:31,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-09-18 11:28:32,110 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:28:32,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-18 11:28:32,110 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:28:32,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:28:32,111 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:28:32,112 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:28:32,112 INFO L87 Difference]: Start difference. First operand 32420 states and 47400 transitions. Second operand 3 states. [2018-09-18 11:28:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:33,855 INFO L93 Difference]: Finished difference Result 67450 states and 101678 transitions. [2018-09-18 11:28:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:28:33,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2018-09-18 11:28:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:34,025 INFO L225 Difference]: With dead ends: 67450 [2018-09-18 11:28:34,025 INFO L226 Difference]: Without dead ends: 35543 [2018-09-18 11:28:34,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 739 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:28:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35543 states. [2018-09-18 11:28:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35543 to 32588. [2018-09-18 11:28:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32588 states. [2018-09-18 11:28:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32588 states to 32588 states and 42986 transitions. [2018-09-18 11:28:35,477 INFO L78 Accepts]: Start accepts. Automaton has 32588 states and 42986 transitions. Word has length 370 [2018-09-18 11:28:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:35,480 INFO L480 AbstractCegarLoop]: Abstraction has 32588 states and 42986 transitions. [2018-09-18 11:28:35,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:28:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32588 states and 42986 transitions. [2018-09-18 11:28:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-09-18 11:28:35,543 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:35,543 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 11:28:35,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1339658866, now seen corresponding path program 1 times [2018-09-18 11:28:35,544 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:35,545 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 320 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:28:36,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:36,085 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:36,093 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:36,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:36,434 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2018-09-18 11:28:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-09-18 11:28:36,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-09-18 11:28:37,184 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 11:28:37,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-09-18 11:28:37,184 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:28:37,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:28:37,185 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:28:37,185 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-18 11:28:37,186 INFO L87 Difference]: Start difference. First operand 32588 states and 42986 transitions. Second operand 3 states. [2018-09-18 11:28:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:39,719 INFO L93 Difference]: Finished difference Result 68159 states and 91335 transitions. [2018-09-18 11:28:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:28:39,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2018-09-18 11:28:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:39,875 INFO L225 Difference]: With dead ends: 68159 [2018-09-18 11:28:39,875 INFO L226 Difference]: Without dead ends: 36084 [2018-09-18 11:28:40,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-18 11:28:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36084 states. [2018-09-18 11:28:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36084 to 36084. [2018-09-18 11:28:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36084 states. [2018-09-18 11:28:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36084 states to 36084 states and 47531 transitions. [2018-09-18 11:28:41,214 INFO L78 Accepts]: Start accepts. Automaton has 36084 states and 47531 transitions. Word has length 371 [2018-09-18 11:28:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:41,215 INFO L480 AbstractCegarLoop]: Abstraction has 36084 states and 47531 transitions. [2018-09-18 11:28:41,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:28:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 36084 states and 47531 transitions. [2018-09-18 11:28:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-09-18 11:28:41,292 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:41,293 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 11:28:41,293 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1050991242, now seen corresponding path program 1 times [2018-09-18 11:28:41,293 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:41,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:41,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:41,294 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:42,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:42,040 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:42,050 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:42,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:42,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:42,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:42,773 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:28:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:42,796 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:43,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:43,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 373 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 11:28:43,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:28:43,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-18 11:28:43,763 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:28:43,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 11:28:43,764 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 11:28:43,764 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:28:43,764 INFO L87 Difference]: Start difference. First operand 36084 states and 47531 transitions. Second operand 9 states. [2018-09-18 11:28:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:48,569 INFO L93 Difference]: Finished difference Result 79675 states and 108089 transitions. [2018-09-18 11:28:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-18 11:28:48,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 435 [2018-09-18 11:28:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:48,693 INFO L225 Difference]: With dead ends: 79675 [2018-09-18 11:28:48,693 INFO L226 Difference]: Without dead ends: 38730 [2018-09-18 11:28:48,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1758 GetRequests, 1735 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-18 11:28:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38730 states. [2018-09-18 11:28:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38730 to 37998. [2018-09-18 11:28:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37998 states. [2018-09-18 11:28:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37998 states to 37998 states and 48135 transitions. [2018-09-18 11:28:49,633 INFO L78 Accepts]: Start accepts. Automaton has 37998 states and 48135 transitions. Word has length 435 [2018-09-18 11:28:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:49,634 INFO L480 AbstractCegarLoop]: Abstraction has 37998 states and 48135 transitions. [2018-09-18 11:28:49,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 11:28:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37998 states and 48135 transitions. [2018-09-18 11:28:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-09-18 11:28:49,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:49,732 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-18 11:28:49,732 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash 193909947, now seen corresponding path program 1 times [2018-09-18 11:28:49,733 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:49,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:49,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:49,734 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 485 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-09-18 11:28:50,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:50,604 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-18 11:28:50,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:50,618 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:50,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 485 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-09-18 11:28:51,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 485 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-09-18 11:28:51,638 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:51,638 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 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:28:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:51,654 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:51,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:28:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 485 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-09-18 11:28:52,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:28:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 485 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-09-18 11:28:52,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:28:52,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 8 [2018-09-18 11:28:52,382 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:28:52,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 11:28:52,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 11:28:52,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-18 11:28:52,385 INFO L87 Difference]: Start difference. First operand 37998 states and 48135 transitions. Second operand 7 states. [2018-09-18 11:28:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:28:56,561 INFO L93 Difference]: Finished difference Result 80414 states and 105180 transitions. [2018-09-18 11:28:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 11:28:56,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 503 [2018-09-18 11:28:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:28:56,712 INFO L225 Difference]: With dead ends: 80414 [2018-09-18 11:28:56,712 INFO L226 Difference]: Without dead ends: 42611 [2018-09-18 11:28:56,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2024 GetRequests, 2010 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:28:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42611 states. [2018-09-18 11:28:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42611 to 41968. [2018-09-18 11:28:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41968 states. [2018-09-18 11:28:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41968 states to 41968 states and 52603 transitions. [2018-09-18 11:28:58,003 INFO L78 Accepts]: Start accepts. Automaton has 41968 states and 52603 transitions. Word has length 503 [2018-09-18 11:28:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:28:58,004 INFO L480 AbstractCegarLoop]: Abstraction has 41968 states and 52603 transitions. [2018-09-18 11:28:58,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 11:28:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 41968 states and 52603 transitions. [2018-09-18 11:28:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-09-18 11:28:58,114 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:28:58,115 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 11:28:58,115 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:28:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1663054835, now seen corresponding path program 1 times [2018-09-18 11:28:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:28:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:28:58,117 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:28:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 178 proven. 348 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-09-18 11:28:58,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:28:58,869 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:28:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:28:58,877 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:28:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:28:59,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:29:05,162 WARN L178 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-18 11:29:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 485 proven. 4 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-09-18 11:29:05,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:29:07,885 WARN L178 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-09-18 11:29:13,003 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-18 11:29:13,006 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:19,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:23,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:25,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:27,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:30,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:32,383 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:34,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:38,820 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:43,118 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:45,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:49,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:53,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:57,003 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:29:59,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:04,826 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:10,984 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:15,195 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:21,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:28,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:30,866 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:33,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-09-18 11:30:37,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 Received shutdown request... [2018-09-18 11:30:42,351 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-18 11:30:42,552 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:30:42,553 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-18 11:30:42,559 WARN L206 ceAbstractionStarter]: Timeout [2018-09-18 11:30:42,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 11:30:42 BoogieIcfgContainer [2018-09-18 11:30:42,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 11:30:42,560 INFO L168 Benchmark]: Toolchain (without parser) took 247157.18 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -475.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,561 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 11:30:42,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 977.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,563 INFO L168 Benchmark]: Boogie Preprocessor took 432.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -933.8 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,564 INFO L168 Benchmark]: RCFGBuilder took 4338.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,565 INFO L168 Benchmark]: TraceAbstraction took 241242.35 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 189.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-18 11:30:42,569 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 977.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 157.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 432.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -933.8 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4338.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241242.35 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 189.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 129). Cancelled while BasicCegarLoop was analyzing trace of length 539 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 17 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 241.1s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 100.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2621 SDtfs, 12678 SDslu, 2518 SDs, 0 SdLazy, 23217 SolverSat, 5220 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 79.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9158 GetRequests, 8973 SyntacticMatches, 34 SemanticMatches, 151 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41968occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 8962 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 7898 NumberOfCodeBlocks, 7898 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 12353 ConstructedInterpolants, 49 QuantifiedInterpolants, 12414834 SizeOfPredicates, 12 NumberOfNonLiveVariables, 7550 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 38 InterpolantComputations, 9 PerfectInterpolantSequences, 11689/12254 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/Problem11_label56_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_11-30-42-592.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label56_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_11-30-42-592.csv Completed graceful shutdown