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/Problem14_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:41:41,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:41:41,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:41:41,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:41:41,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:41:41,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:41:41,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:41:41,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:41:41,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:41:41,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:41:41,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:41:41,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:41:41,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:41:41,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:41:41,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:41:41,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:41:41,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:41:41,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:41:41,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:41:41,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:41:41,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:41:41,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:41:41,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:41:41,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:41:41,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:41:41,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:41:41,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:41:41,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:41:41,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:41:41,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:41:41,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:41:41,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:41:41,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:41:41,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:41:41,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:41:41,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:41:41,739 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 17:41:41,765 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:41:41,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:41:41,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:41:41,768 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:41:41,768 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:41:41,768 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:41:41,768 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:41:41,768 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:41:41,769 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:41:41,769 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:41:41,769 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:41:41,770 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:41:41,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:41:41,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:41:41,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:41:41,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:41:41,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:41:41,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:41:41,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:41:41,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:41:41,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:41:41,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:41:41,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:41:41,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:41:41,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:41:41,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:41:41,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:41:41,774 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:41:41,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:41:41,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:41:41,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:41:41,775 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:41:41,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:41:41,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:41:41,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:41:41,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:41:41,856 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:41:41,857 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:41:41,858 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-14 17:41:42,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd465c378/cea03c50078b4527b4cb5a5d851ea2b5/FLAG2fb4f99f2 [2018-09-14 17:41:42,445 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:41:42,446 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-14 17:41:42,465 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd465c378/cea03c50078b4527b4cb5a5d851ea2b5/FLAG2fb4f99f2 [2018-09-14 17:41:42,494 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd465c378/cea03c50078b4527b4cb5a5d851ea2b5 [2018-09-14 17:41:42,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:41:42,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:41:42,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:41:42,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:41:42,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:41:42,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:41:42" (1/1) ... [2018-09-14 17:41:42,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c40084a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:42, skipping insertion in model container [2018-09-14 17:41:42,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:41:42" (1/1) ... [2018-09-14 17:41:42,544 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:41:43,145 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:41:43,167 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:41:43,314 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:41:43,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43 WrapperNode [2018-09-14 17:41:43,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:41:43,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:41:43,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:41:43,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:41:43,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:41:43,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:41:43,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:41:43,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:41:43,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... [2018-09-14 17:41:43,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:41:43,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:41:43,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:41:43,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:41:43,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:41:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:41:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:41:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:41:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:41:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:41:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:41:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:41:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:41:47,467 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:41:47,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:41:47 BoogieIcfgContainer [2018-09-14 17:41:47,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:41:47,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:41:47,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:41:47,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:41:47,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:41:42" (1/3) ... [2018-09-14 17:41:47,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66951f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:41:47, skipping insertion in model container [2018-09-14 17:41:47,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:41:43" (2/3) ... [2018-09-14 17:41:47,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66951f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:41:47, skipping insertion in model container [2018-09-14 17:41:47,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:41:47" (3/3) ... [2018-09-14 17:41:47,484 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-09-14 17:41:47,493 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:41:47,501 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:41:47,553 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:41:47,554 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:41:47,554 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:41:47,554 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:41:47,554 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:41:47,555 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:41:47,555 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:41:47,555 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:41:47,555 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:41:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-14 17:41:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-14 17:41:47,613 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:41:47,614 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:41:47,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:41:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash -353931284, now seen corresponding path program 1 times [2018-09-14 17:41:47,627 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:41:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:47,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:41:47,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:47,679 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:41:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:41:48,222 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-09-14 17:41:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:48,249 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:41:48,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:41:48,249 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:41:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:41:48,274 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:41:48,275 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:41:48,277 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 4 states. [2018-09-14 17:41:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:41:51,363 INFO L93 Difference]: Finished difference Result 894 states and 1611 transitions. [2018-09-14 17:41:51,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:41:51,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-09-14 17:41:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:41:51,390 INFO L225 Difference]: With dead ends: 894 [2018-09-14 17:41:51,390 INFO L226 Difference]: Without dead ends: 633 [2018-09-14 17:41:51,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:41:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-09-14 17:41:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-09-14 17:41:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-09-14 17:41:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1007 transitions. [2018-09-14 17:41:51,523 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1007 transitions. Word has length 64 [2018-09-14 17:41:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:41:51,523 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 1007 transitions. [2018-09-14 17:41:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:41:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1007 transitions. [2018-09-14 17:41:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-14 17:41:51,536 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:41:51,536 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:41:51,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:41:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 835688739, now seen corresponding path program 1 times [2018-09-14 17:41:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:41:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:41:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:51,539 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:41:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:41:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:51,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:41:51,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:41:51,918 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:41:51,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:41:51,920 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:41:51,920 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:41:51,921 INFO L87 Difference]: Start difference. First operand 633 states and 1007 transitions. Second operand 4 states. [2018-09-14 17:41:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:41:55,010 INFO L93 Difference]: Finished difference Result 2358 states and 3926 transitions. [2018-09-14 17:41:55,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:41:55,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-09-14 17:41:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:41:55,030 INFO L225 Difference]: With dead ends: 2358 [2018-09-14 17:41:55,030 INFO L226 Difference]: Without dead ends: 1731 [2018-09-14 17:41:55,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:41:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-09-14 17:41:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2018-09-14 17:41:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-09-14 17:41:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2621 transitions. [2018-09-14 17:41:55,125 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2621 transitions. Word has length 177 [2018-09-14 17:41:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:41:55,127 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2621 transitions. [2018-09-14 17:41:55,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:41:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2621 transitions. [2018-09-14 17:41:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-14 17:41:55,144 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:41:55,145 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-09-14 17:41:55,145 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:41:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1405952572, now seen corresponding path program 1 times [2018-09-14 17:41:55,146 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:41:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:55,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:41:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:41:55,148 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:41:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:41:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:55,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:41:55,790 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:41:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:41:55,811 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:41:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:41:55,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:41:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:56,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:41:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:57,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:41:57,281 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:41:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:41:57,309 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:41:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:41:57,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:41:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:57,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:41:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:41:57,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:41:57,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:41:57,942 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:41:57,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:41:57,943 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:41:57,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:41:57,944 INFO L87 Difference]: Start difference. First operand 1731 states and 2621 transitions. Second operand 9 states. [2018-09-14 17:42:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:04,917 INFO L93 Difference]: Finished difference Result 5315 states and 8807 transitions. [2018-09-14 17:42:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-14 17:42:04,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 260 [2018-09-14 17:42:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:04,947 INFO L225 Difference]: With dead ends: 5315 [2018-09-14 17:42:04,947 INFO L226 Difference]: Without dead ends: 2965 [2018-09-14 17:42:04,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1038 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-09-14 17:42:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2018-09-14 17:42:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2900. [2018-09-14 17:42:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2018-09-14 17:42:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4107 transitions. [2018-09-14 17:42:05,094 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4107 transitions. Word has length 260 [2018-09-14 17:42:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:05,094 INFO L480 AbstractCegarLoop]: Abstraction has 2900 states and 4107 transitions. [2018-09-14 17:42:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:42:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4107 transitions. [2018-09-14 17:42:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-14 17:42:05,107 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:05,107 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-14 17:42:05,107 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1165177760, now seen corresponding path program 1 times [2018-09-14 17:42:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:05,109 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:05,690 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-14 17:42:06,135 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-09-14 17:42:06,370 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-14 17:42:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:06,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:06,972 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:06,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:06,981 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:07,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 17:42:07,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-14 17:42:07,378 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 17:42:07,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 13 [2018-09-14 17:42:07,379 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:42:07,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:42:07,380 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:42:07,380 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:42:07,380 INFO L87 Difference]: Start difference. First operand 2900 states and 4107 transitions. Second operand 3 states. [2018-09-14 17:42:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:09,236 INFO L93 Difference]: Finished difference Result 8244 states and 12421 transitions. [2018-09-14 17:42:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:42:09,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-09-14 17:42:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:09,283 INFO L225 Difference]: With dead ends: 8244 [2018-09-14 17:42:09,283 INFO L226 Difference]: Without dead ends: 5350 [2018-09-14 17:42:09,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:42:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2018-09-14 17:42:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 5350. [2018-09-14 17:42:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5350 states. [2018-09-14 17:42:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5350 states to 5350 states and 7350 transitions. [2018-09-14 17:42:09,494 INFO L78 Accepts]: Start accepts. Automaton has 5350 states and 7350 transitions. Word has length 264 [2018-09-14 17:42:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:09,495 INFO L480 AbstractCegarLoop]: Abstraction has 5350 states and 7350 transitions. [2018-09-14 17:42:09,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:42:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5350 states and 7350 transitions. [2018-09-14 17:42:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-14 17:42:09,516 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:09,517 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:09,517 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -470539796, now seen corresponding path program 1 times [2018-09-14 17:42:09,518 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:09,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:09,519 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:10,065 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:10,065 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) [2018-09-14 17:42:10,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:10,083 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:10,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:10,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:10,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:10,641 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:42:10,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:10,657 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:10,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:10,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:11,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:42:11,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:42:11,053 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:42:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:42:11,054 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:42:11,054 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:42:11,055 INFO L87 Difference]: Start difference. First operand 5350 states and 7350 transitions. Second operand 9 states. [2018-09-14 17:42:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:14,363 INFO L93 Difference]: Finished difference Result 10581 states and 14724 transitions. [2018-09-14 17:42:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-14 17:42:14,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 272 [2018-09-14 17:42:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:14,389 INFO L225 Difference]: With dead ends: 10581 [2018-09-14 17:42:14,389 INFO L226 Difference]: Without dead ends: 4268 [2018-09-14 17:42:14,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 1085 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-14 17:42:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2018-09-14 17:42:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4163. [2018-09-14 17:42:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2018-09-14 17:42:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 5275 transitions. [2018-09-14 17:42:14,542 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 5275 transitions. Word has length 272 [2018-09-14 17:42:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:14,543 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 5275 transitions. [2018-09-14 17:42:14,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:42:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 5275 transitions. [2018-09-14 17:42:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-14 17:42:14,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:14,561 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 17:42:14,561 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1742187711, now seen corresponding path program 1 times [2018-09-14 17:42:14,561 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:14,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:14,563 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 165 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:15,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:15,072 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:15,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:15,079 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:15,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-09-14 17:42:15,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-09-14 17:42:15,331 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 17:42:15,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-14 17:42:15,332 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:42:15,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:42:15,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:42:15,332 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:42:15,333 INFO L87 Difference]: Start difference. First operand 4163 states and 5275 transitions. Second operand 3 states. [2018-09-14 17:42:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:16,441 INFO L93 Difference]: Finished difference Result 9284 states and 12390 transitions. [2018-09-14 17:42:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:42:16,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-09-14 17:42:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:16,478 INFO L225 Difference]: With dead ends: 9284 [2018-09-14 17:42:16,478 INFO L226 Difference]: Without dead ends: 5490 [2018-09-14 17:42:16,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 566 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:42:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5490 states. [2018-09-14 17:42:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5490 to 5300. [2018-09-14 17:42:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5300 states. [2018-09-14 17:42:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6949 transitions. [2018-09-14 17:42:16,644 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6949 transitions. Word has length 283 [2018-09-14 17:42:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:16,645 INFO L480 AbstractCegarLoop]: Abstraction has 5300 states and 6949 transitions. [2018-09-14 17:42:16,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:42:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6949 transitions. [2018-09-14 17:42:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-14 17:42:16,666 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:16,667 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 17:42:16,667 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2078166013, now seen corresponding path program 1 times [2018-09-14 17:42:16,668 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:16,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:16,669 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:17,176 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-09-14 17:42:17,372 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-14 17:42:17,836 WARN L178 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2018-09-14 17:42:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 167 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:18,518 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:18,518 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:18,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:18,526 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:18,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-14 17:42:18,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 114 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:42:19,593 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:42:19,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 17 [2018-09-14 17:42:19,594 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:42:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:42:19,594 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:42:19,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-09-14 17:42:19,595 INFO L87 Difference]: Start difference. First operand 5300 states and 6949 transitions. Second operand 5 states. [2018-09-14 17:42:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:21,975 INFO L93 Difference]: Finished difference Result 12868 states and 16626 transitions. [2018-09-14 17:42:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 17:42:21,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2018-09-14 17:42:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:22,031 INFO L225 Difference]: With dead ends: 12868 [2018-09-14 17:42:22,031 INFO L226 Difference]: Without dead ends: 6995 [2018-09-14 17:42:22,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 590 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-09-14 17:42:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2018-09-14 17:42:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 6382. [2018-09-14 17:42:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6382 states. [2018-09-14 17:42:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 8186 transitions. [2018-09-14 17:42:22,246 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 8186 transitions. Word has length 297 [2018-09-14 17:42:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:22,248 INFO L480 AbstractCegarLoop]: Abstraction has 6382 states and 8186 transitions. [2018-09-14 17:42:22,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:42:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 8186 transitions. [2018-09-14 17:42:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-14 17:42:22,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:22,282 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:22,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1323555208, now seen corresponding path program 1 times [2018-09-14 17:42:22,283 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:22,284 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:22,590 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:42:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 171 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-14 17:42:22,676 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:22,676 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:22,748 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:22,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-09-14 17:42:23,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 171 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-14 17:42:24,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:42:24,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-09-14 17:42:24,225 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:42:24,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:42:24,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:42:24,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:42:24,227 INFO L87 Difference]: Start difference. First operand 6382 states and 8186 transitions. Second operand 5 states. [2018-09-14 17:42:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:25,350 INFO L93 Difference]: Finished difference Result 11398 states and 14364 transitions. [2018-09-14 17:42:25,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:42:25,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 368 [2018-09-14 17:42:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:25,374 INFO L225 Difference]: With dead ends: 11398 [2018-09-14 17:42:25,375 INFO L226 Difference]: Without dead ends: 5418 [2018-09-14 17:42:25,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 730 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:42:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2018-09-14 17:42:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 5339. [2018-09-14 17:42:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5339 states. [2018-09-14 17:42:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5339 states to 5339 states and 6220 transitions. [2018-09-14 17:42:25,510 INFO L78 Accepts]: Start accepts. Automaton has 5339 states and 6220 transitions. Word has length 368 [2018-09-14 17:42:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:25,512 INFO L480 AbstractCegarLoop]: Abstraction has 5339 states and 6220 transitions. [2018-09-14 17:42:25,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:42:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5339 states and 6220 transitions. [2018-09-14 17:42:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-14 17:42:25,535 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:25,536 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-09-14 17:42:25,536 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -778089676, now seen corresponding path program 1 times [2018-09-14 17:42:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:25,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:25,538 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 259 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:42:26,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:26,466 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-14 17:42:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:26,477 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:26,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 343 proven. 53 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-14 17:42:27,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 181 proven. 268 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:42:27,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:27,570 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 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:42:27,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:27,587 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:27,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 343 proven. 53 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-14 17:42:28,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 181 proven. 268 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:42:29,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:42:29,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8, 8, 8] total 26 [2018-09-14 17:42:29,056 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:42:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 17:42:29,058 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 17:42:29,058 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-14 17:42:29,059 INFO L87 Difference]: Start difference. First operand 5339 states and 6220 transitions. Second operand 15 states. [2018-09-14 17:42:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:32,785 INFO L93 Difference]: Finished difference Result 11478 states and 13350 transitions. [2018-09-14 17:42:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-14 17:42:32,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 382 [2018-09-14 17:42:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:32,804 INFO L225 Difference]: With dead ends: 11478 [2018-09-14 17:42:32,804 INFO L226 Difference]: Without dead ends: 6312 [2018-09-14 17:42:32,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1569 GetRequests, 1526 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=401, Invalid=1239, Unknown=0, NotChecked=0, Total=1640 [2018-09-14 17:42:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2018-09-14 17:42:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 5985. [2018-09-14 17:42:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5985 states. [2018-09-14 17:42:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 6662 transitions. [2018-09-14 17:42:32,915 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 6662 transitions. Word has length 382 [2018-09-14 17:42:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:32,916 INFO L480 AbstractCegarLoop]: Abstraction has 5985 states and 6662 transitions. [2018-09-14 17:42:32,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-14 17:42:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 6662 transitions. [2018-09-14 17:42:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-09-14 17:42:32,936 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:32,936 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:32,937 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1321845615, now seen corresponding path program 1 times [2018-09-14 17:42:32,937 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:32,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:32,938 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 278 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:42:33,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:33,624 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:33,632 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:33,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-09-14 17:42:33,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 171 proven. 210 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-14 17:42:34,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:42:34,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 16 [2018-09-14 17:42:34,372 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:42:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:42:34,372 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:42:34,372 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-09-14 17:42:34,373 INFO L87 Difference]: Start difference. First operand 5985 states and 6662 transitions. Second operand 5 states. [2018-09-14 17:42:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:35,783 INFO L93 Difference]: Finished difference Result 11405 states and 12863 transitions. [2018-09-14 17:42:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 17:42:35,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 407 [2018-09-14 17:42:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:35,799 INFO L225 Difference]: With dead ends: 11405 [2018-09-14 17:42:35,800 INFO L226 Difference]: Without dead ends: 5794 [2018-09-14 17:42:35,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 811 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-09-14 17:42:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2018-09-14 17:42:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 5781. [2018-09-14 17:42:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5781 states. [2018-09-14 17:42:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 6406 transitions. [2018-09-14 17:42:35,912 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 6406 transitions. Word has length 407 [2018-09-14 17:42:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:35,912 INFO L480 AbstractCegarLoop]: Abstraction has 5781 states and 6406 transitions. [2018-09-14 17:42:35,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:42:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 6406 transitions. [2018-09-14 17:42:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-09-14 17:42:35,931 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:35,931 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:35,932 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1026888460, now seen corresponding path program 1 times [2018-09-14 17:42:35,932 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:35,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:35,933 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 460 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-14 17:42:36,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:36,618 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:36,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:36,627 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:36,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 726 proven. 2 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-14 17:42:36,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:37,033 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-09-14 17:42:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 460 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-14 17:42:37,471 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:37,471 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-14 17:42:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:37,486 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:37,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 722 proven. 6 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-14 17:42:38,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 460 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-14 17:42:38,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:42:38,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 8 [2018-09-14 17:42:38,452 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:42:38,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 17:42:38,453 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 17:42:38,454 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:42:38,454 INFO L87 Difference]: Start difference. First operand 5781 states and 6406 transitions. Second operand 7 states. [2018-09-14 17:42:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:40,420 INFO L93 Difference]: Finished difference Result 12681 states and 14103 transitions. [2018-09-14 17:42:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 17:42:40,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 518 [2018-09-14 17:42:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:40,435 INFO L225 Difference]: With dead ends: 12681 [2018-09-14 17:42:40,435 INFO L226 Difference]: Without dead ends: 5588 [2018-09-14 17:42:40,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2091 GetRequests, 2069 SyntacticMatches, 11 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:42:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2018-09-14 17:42:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5449. [2018-09-14 17:42:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-09-14 17:42:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 5901 transitions. [2018-09-14 17:42:40,533 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 5901 transitions. Word has length 518 [2018-09-14 17:42:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:40,534 INFO L480 AbstractCegarLoop]: Abstraction has 5449 states and 5901 transitions. [2018-09-14 17:42:40,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 17:42:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 5901 transitions. [2018-09-14 17:42:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-09-14 17:42:40,545 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:40,545 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:40,546 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 569952995, now seen corresponding path program 1 times [2018-09-14 17:42:40,546 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:40,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:40,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:40,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:40,547 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:41,126 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-14 17:42:41,322 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-14 17:42:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 616 proven. 482 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-09-14 17:42:42,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:42,417 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-14 17:42:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:42,424 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:42,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 956 proven. 2 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-09-14 17:42:42,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 610 proven. 112 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2018-09-14 17:42:43,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:43,499 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 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:42:43,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:43,564 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:42:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:43,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 748 proven. 210 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-09-14 17:42:44,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:44,837 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 17:42:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 321 proven. 690 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-14 17:42:45,556 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:42:45,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 8, 8] total 16 [2018-09-14 17:42:45,556 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:42:45,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 17:42:45,558 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 17:42:45,559 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-09-14 17:42:45,559 INFO L87 Difference]: Start difference. First operand 5449 states and 5901 transitions. Second operand 13 states. [2018-09-14 17:42:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:42:48,413 INFO L93 Difference]: Finished difference Result 10888 states and 12055 transitions. [2018-09-14 17:42:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-14 17:42:48,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 603 [2018-09-14 17:42:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:42:48,443 INFO L225 Difference]: With dead ends: 10888 [2018-09-14 17:42:48,443 INFO L226 Difference]: Without dead ends: 5419 [2018-09-14 17:42:48,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2440 GetRequests, 2402 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2018-09-14 17:42:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2018-09-14 17:42:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 5284. [2018-09-14 17:42:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5284 states. [2018-09-14 17:42:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 5632 transitions. [2018-09-14 17:42:48,592 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 5632 transitions. Word has length 603 [2018-09-14 17:42:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:42:48,593 INFO L480 AbstractCegarLoop]: Abstraction has 5284 states and 5632 transitions. [2018-09-14 17:42:48,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 17:42:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 5632 transitions. [2018-09-14 17:42:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-09-14 17:42:48,605 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:42:48,606 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:42:48,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:42:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1785992905, now seen corresponding path program 2 times [2018-09-14 17:42:48,607 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:42:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:42:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:42:48,608 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:42:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:42:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 642 proven. 534 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-09-14 17:42:50,119 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:50,119 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:42:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 17:42:50,128 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 17:42:50,286 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 17:42:50,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 17:42:50,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 1008 proven. 2 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2018-09-14 17:42:50,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 636 proven. 112 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-09-14 17:42:52,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:42:52,110 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 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:42:52,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 17:42:52,126 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 17:42:52,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 17:42:52,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 17:42:52,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:42:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 993 proven. 17 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2018-09-14 17:42:54,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:42:54,436 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-09-14 17:42:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 315 proven. 748 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-14 17:42:56,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:42:56,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5, 10, 11] total 31 [2018-09-14 17:42:56,446 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:42:56,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-14 17:42:56,447 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-14 17:42:56,448 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-09-14 17:42:56,448 INFO L87 Difference]: Start difference. First operand 5284 states and 5632 transitions. Second operand 18 states. [2018-09-14 17:42:57,231 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2018-09-14 17:43:00,167 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-09-14 17:43:01,402 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-09-14 17:43:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:43:02,583 INFO L93 Difference]: Finished difference Result 10887 states and 11746 transitions. [2018-09-14 17:43:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-14 17:43:02,583 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 629 [2018-09-14 17:43:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:43:02,596 INFO L225 Difference]: With dead ends: 10887 [2018-09-14 17:43:02,596 INFO L226 Difference]: Without dead ends: 5662 [2018-09-14 17:43:02,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2585 GetRequests, 2510 SyntacticMatches, 14 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=734, Invalid=3172, Unknown=0, NotChecked=0, Total=3906 [2018-09-14 17:43:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2018-09-14 17:43:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5284. [2018-09-14 17:43:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5284 states. [2018-09-14 17:43:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 5570 transitions. [2018-09-14 17:43:02,691 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 5570 transitions. Word has length 629 [2018-09-14 17:43:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:43:02,692 INFO L480 AbstractCegarLoop]: Abstraction has 5284 states and 5570 transitions. [2018-09-14 17:43:02,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-14 17:43:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 5570 transitions. [2018-09-14 17:43:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2018-09-14 17:43:02,701 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:43:02,702 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:43:02,702 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:43:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 939298755, now seen corresponding path program 1 times [2018-09-14 17:43:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:43:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:02,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 17:43:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:02,704 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:43:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:03,273 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-14 17:43:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 785 proven. 683 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-09-14 17:43:04,310 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:04,310 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:43:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:04,319 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:04,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1227 proven. 2 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-09-14 17:43:04,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 777 proven. 112 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2018-09-14 17:43:05,940 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:05,940 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 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:43:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:05,956 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:06,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1221 proven. 8 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-09-14 17:43:06,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:07,112 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-09-14 17:43:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 366 proven. 916 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-09-14 17:43:08,378 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:43:08,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5, 8, 8] total 28 [2018-09-14 17:43:08,379 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:43:08,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-14 17:43:08,380 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-14 17:43:08,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-09-14 17:43:08,381 INFO L87 Difference]: Start difference. First operand 5284 states and 5570 transitions. Second operand 17 states. [2018-09-14 17:43:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:43:15,488 INFO L93 Difference]: Finished difference Result 10426 states and 11198 transitions. [2018-09-14 17:43:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-14 17:43:15,489 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 755 [2018-09-14 17:43:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:43:15,500 INFO L225 Difference]: With dead ends: 10426 [2018-09-14 17:43:15,500 INFO L226 Difference]: Without dead ends: 4364 [2018-09-14 17:43:15,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3089 GetRequests, 3018 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=956, Invalid=3334, Unknown=0, NotChecked=0, Total=4290 [2018-09-14 17:43:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2018-09-14 17:43:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3833. [2018-09-14 17:43:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3833 states. [2018-09-14 17:43:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4005 transitions. [2018-09-14 17:43:15,580 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4005 transitions. Word has length 755 [2018-09-14 17:43:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:43:15,581 INFO L480 AbstractCegarLoop]: Abstraction has 3833 states and 4005 transitions. [2018-09-14 17:43:15,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-14 17:43:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4005 transitions. [2018-09-14 17:43:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-09-14 17:43:15,589 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:43:15,590 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:43:15,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:43:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash -341518496, now seen corresponding path program 1 times [2018-09-14 17:43:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:43:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:15,592 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:43:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 607 proven. 150 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2018-09-14 17:43:16,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:16,194 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:43:16,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:16,204 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:16,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 1293 proven. 2 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-09-14 17:43:16,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 607 proven. 150 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2018-09-14 17:43:17,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:17,102 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 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:43:17,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:17,118 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:17,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 1293 proven. 2 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-09-14 17:43:17,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 607 proven. 150 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2018-09-14 17:43:18,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:43:18,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 8 [2018-09-14 17:43:18,102 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:43:18,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 17:43:18,103 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 17:43:18,104 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:43:18,104 INFO L87 Difference]: Start difference. First operand 3833 states and 4005 transitions. Second operand 7 states. [2018-09-14 17:43:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:43:19,325 INFO L93 Difference]: Finished difference Result 8575 states and 9003 transitions. [2018-09-14 17:43:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 17:43:19,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 780 [2018-09-14 17:43:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:43:19,336 INFO L225 Difference]: With dead ends: 8575 [2018-09-14 17:43:19,337 INFO L226 Difference]: Without dead ends: 4933 [2018-09-14 17:43:19,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3131 GetRequests, 3117 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:43:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2018-09-14 17:43:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 4912. [2018-09-14 17:43:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2018-09-14 17:43:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 5124 transitions. [2018-09-14 17:43:19,418 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 5124 transitions. Word has length 780 [2018-09-14 17:43:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:43:19,418 INFO L480 AbstractCegarLoop]: Abstraction has 4912 states and 5124 transitions. [2018-09-14 17:43:19,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 17:43:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 5124 transitions. [2018-09-14 17:43:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2018-09-14 17:43:19,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:43:19,430 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:43:19,431 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:43:19,431 INFO L82 PathProgramCache]: Analyzing trace with hash -547905968, now seen corresponding path program 1 times [2018-09-14 17:43:19,431 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:43:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:19,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:19,432 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:43:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 754 proven. 150 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-09-14 17:43:20,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:20,483 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:43:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:20,491 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:20,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1710 proven. 2 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2018-09-14 17:43:21,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 754 proven. 150 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-09-14 17:43:21,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:21,483 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 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:43:21,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:21,500 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:21,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1710 proven. 2 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2018-09-14 17:43:22,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 754 proven. 150 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-09-14 17:43:22,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:43:22,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 11 [2018-09-14 17:43:22,750 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:43:22,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 17:43:22,751 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 17:43:22,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:43:22,752 INFO L87 Difference]: Start difference. First operand 4912 states and 5124 transitions. Second operand 10 states. [2018-09-14 17:43:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:43:24,992 INFO L93 Difference]: Finished difference Result 10019 states and 10483 transitions. [2018-09-14 17:43:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-14 17:43:24,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 940 [2018-09-14 17:43:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:43:25,002 INFO L225 Difference]: With dead ends: 10019 [2018-09-14 17:43:25,002 INFO L226 Difference]: Without dead ends: 5298 [2018-09-14 17:43:25,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3789 GetRequests, 3765 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-09-14 17:43:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-14 17:43:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 5278. [2018-09-14 17:43:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2018-09-14 17:43:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 5487 transitions. [2018-09-14 17:43:25,078 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 5487 transitions. Word has length 940 [2018-09-14 17:43:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:43:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 5278 states and 5487 transitions. [2018-09-14 17:43:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 17:43:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 5487 transitions. [2018-09-14 17:43:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2018-09-14 17:43:25,092 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:43:25,092 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:43:25,093 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:43:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1429393864, now seen corresponding path program 1 times [2018-09-14 17:43:25,093 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:43:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:25,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:25,094 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:43:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1353 proven. 2247 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-09-14 17:43:29,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:29,576 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:43:29,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:29,584 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:29,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1350 proven. 2 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2018-09-14 17:43:30,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:30,641 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-14 17:43:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1350 proven. 2 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2018-09-14 17:43:32,062 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:32,062 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 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:43:32,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:32,089 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:32,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 2442 proven. 6 refuted. 0 times theorem prover too weak. 1499 trivial. 0 not checked. [2018-09-14 17:43:33,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1717 proven. 271 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2018-09-14 17:43:35,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:43:35,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5, 5, 7, 8] total 44 [2018-09-14 17:43:35,111 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:43:35,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-14 17:43:35,113 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-14 17:43:35,113 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2018-09-14 17:43:35,113 INFO L87 Difference]: Start difference. First operand 5278 states and 5487 transitions. Second operand 31 states. [2018-09-14 17:43:37,408 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2018-09-14 17:43:38,293 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2018-09-14 17:43:39,398 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2018-09-14 17:43:42,342 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-09-14 17:43:43,564 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-09-14 17:43:44,185 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-09-14 17:43:44,533 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-09-14 17:43:47,575 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-09-14 17:43:48,247 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-09-14 17:43:48,558 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-09-14 17:43:49,398 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-09-14 17:43:50,765 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2018-09-14 17:43:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:43:54,002 INFO L93 Difference]: Finished difference Result 10714 states and 11246 transitions. [2018-09-14 17:43:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-14 17:43:54,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1120 [2018-09-14 17:43:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:43:54,008 INFO L225 Difference]: With dead ends: 10714 [2018-09-14 17:43:54,008 INFO L226 Difference]: Without dead ends: 3305 [2018-09-14 17:43:54,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4620 GetRequests, 4506 SyntacticMatches, 6 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1709, Invalid=10281, Unknown=0, NotChecked=0, Total=11990 [2018-09-14 17:43:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2018-09-14 17:43:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 2925. [2018-09-14 17:43:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-09-14 17:43:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 2977 transitions. [2018-09-14 17:43:54,066 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 2977 transitions. Word has length 1120 [2018-09-14 17:43:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:43:54,067 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 2977 transitions. [2018-09-14 17:43:54,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-14 17:43:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 2977 transitions. [2018-09-14 17:43:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-09-14 17:43:54,081 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:43:54,082 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-09-14 17:43:54,082 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:43:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1615558360, now seen corresponding path program 1 times [2018-09-14 17:43:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:43:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:43:54,084 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:43:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 1866 proven. 355 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2018-09-14 17:43:55,999 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:55,999 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:43:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:56,007 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:56,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 2631 proven. 6 refuted. 0 times theorem prover too weak. 1547 trivial. 0 not checked. [2018-09-14 17:43:56,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 1866 proven. 359 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2018-09-14 17:43:57,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:43:57,997 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 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:43:58,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:43:58,013 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:43:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:43:58,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:43:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 2631 proven. 6 refuted. 0 times theorem prover too weak. 1547 trivial. 0 not checked. [2018-09-14 17:43:59,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:43:59,341 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-14 17:44:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 1866 proven. 359 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2018-09-14 17:44:01,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:44:01,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 14 [2018-09-14 17:44:01,348 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:44:01,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:44:01,349 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:44:01,349 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-14 17:44:01,350 INFO L87 Difference]: Start difference. First operand 2925 states and 2977 transitions. Second operand 9 states. [2018-09-14 17:44:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:44:03,080 INFO L93 Difference]: Finished difference Result 4630 states and 4735 transitions. [2018-09-14 17:44:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-14 17:44:03,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1168 [2018-09-14 17:44:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:44:03,087 INFO L225 Difference]: With dead ends: 4630 [2018-09-14 17:44:03,087 INFO L226 Difference]: Without dead ends: 3518 [2018-09-14 17:44:03,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4691 GetRequests, 4668 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2018-09-14 17:44:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2018-09-14 17:44:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3110. [2018-09-14 17:44:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2018-09-14 17:44:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 3163 transitions. [2018-09-14 17:44:03,139 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 3163 transitions. Word has length 1168 [2018-09-14 17:44:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:44:03,139 INFO L480 AbstractCegarLoop]: Abstraction has 3110 states and 3163 transitions. [2018-09-14 17:44:03,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:44:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 3163 transitions. [2018-09-14 17:44:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1726 [2018-09-14 17:44:03,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:44:03,160 INFO L376 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-09-14 17:44:03,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:44:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2146450787, now seen corresponding path program 1 times [2018-09-14 17:44:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:44:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:44:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:44:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:44:03,162 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:44:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:44:04,431 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-14 17:44:04,602 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-09-14 17:44:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 2024 proven. 5514 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2018-09-14 17:44:09,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:44:09,063 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:44:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:44:09,093 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:44:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:44:09,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:44:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 3105 proven. 127 refuted. 0 times theorem prover too weak. 5957 trivial. 0 not checked. [2018-09-14 17:44:10,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:44:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 3147 proven. 198 refuted. 0 times theorem prover too weak. 5844 trivial. 0 not checked. [2018-09-14 17:44:14,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:44:14,141 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 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:44:14,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:44:14,159 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:44:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:44:15,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:44:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 3105 proven. 127 refuted. 0 times theorem prover too weak. 5957 trivial. 0 not checked. [2018-09-14 17:44:16,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:44:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 3223 proven. 122 refuted. 0 times theorem prover too weak. 5844 trivial. 0 not checked. [2018-09-14 17:44:19,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:44:19,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 10, 8, 9] total 47 [2018-09-14 17:44:19,023 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:44:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-14 17:44:19,025 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-14 17:44:19,026 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-09-14 17:44:19,026 INFO L87 Difference]: Start difference. First operand 3110 states and 3163 transitions. Second operand 34 states. [2018-09-14 17:44:21,038 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 21 [2018-09-14 17:44:22,992 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-09-14 17:44:23,168 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-09-14 17:44:24,136 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-09-14 17:44:24,283 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2018-09-14 17:44:24,969 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-09-14 17:44:25,692 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-09-14 17:44:25,853 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-09-14 17:44:26,479 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-09-14 17:44:26,741 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-09-14 17:44:33,011 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2018-09-14 17:44:36,348 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-09-14 17:44:38,265 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-09-14 17:44:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:44:39,428 INFO L93 Difference]: Finished difference Result 4856 states and 4983 transitions. [2018-09-14 17:44:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-14 17:44:39,429 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1725 [2018-09-14 17:44:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:44:39,430 INFO L225 Difference]: With dead ends: 4856 [2018-09-14 17:44:39,430 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 17:44:39,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7035 GetRequests, 6909 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3918 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3036, Invalid=11970, Unknown=0, NotChecked=0, Total=15006 [2018-09-14 17:44:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 17:44:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 17:44:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 17:44:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 17:44:39,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1725 [2018-09-14 17:44:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:44:39,439 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 17:44:39,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-14 17:44:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 17:44:39,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 17:44:39,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 17:44:39,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:39,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:40,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,059 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 544 DAG size of output: 399 [2018-09-14 17:44:41,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:41,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:42,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:44:42,207 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 544 DAG size of output: 399 [2018-09-14 17:44:42,621 WARN L178 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 16 [2018-09-14 17:44:43,650 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 80 DAG size of output: 28 [2018-09-14 17:44:47,673 WARN L178 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 341 DAG size of output: 143 [2018-09-14 17:44:50,404 WARN L178 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 379 DAG size of output: 112 [2018-09-14 17:44:53,384 WARN L178 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 379 DAG size of output: 112 [2018-09-14 17:44:53,388 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 17:44:53,388 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-09-14 17:44:53,389 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-09-14 17:44:53,390 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-09-14 17:44:53,391 INFO L426 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-14 17:44:53,392 INFO L426 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-14 17:44:53,393 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,394 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,395 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,396 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-14 17:44:53,397 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse16 (= 7 |old(~a15~0)|)) (.cse30 (= 9 ~a15~0)) (.cse6 (= 8 ~a15~0)) (.cse20 (= ~a24~0 |old(~a24~0)|)) (.cse3 (= ~a12~0 |old(~a12~0)|)) (.cse8 (<= |old(~a21~0)| ~a21~0)) (.cse14 (= |old(~a15~0)| ~a15~0)) (.cse4 (= 1 ~a24~0)) (.cse5 (<= ~a21~0 |old(~a21~0)|))) (let ((.cse9 (< 7 |old(~a21~0)|)) (.cse10 (and .cse3 .cse8 .cse14 .cse4 .cse5)) (.cse11 (< |old(~a21~0)| 10)) (.cse7 (<= 8 ~a21~0)) (.cse19 (< 6 |old(~a21~0)|)) (.cse21 (< |old(~a21~0)| 8)) (.cse18 (and .cse3 .cse20 .cse8 .cse14 .cse5)) (.cse22 (= 10 |old(~a21~0)|)) (.cse23 (<= |old(~a12~0)| 80)) (.cse29 (and .cse3 .cse8 .cse4 .cse5 .cse6)) (.cse0 (not (= 8 |old(~a15~0)|))) (.cse27 (< 11 |old(~a12~0)|)) (.cse17 (< 7 |old(~a15~0)|)) (.cse15 (< 0 (+ |old(~a12~0)| 49))) (.cse24 (not (= 7 |old(~a21~0)|))) (.cse13 (not (= 6 |old(~a15~0)|))) (.cse31 (< |old(~a12~0)| 81)) (.cse26 (and .cse3 .cse8 .cse4 .cse5 .cse30)) (.cse25 (not (= 9 |old(~a15~0)|))) (.cse2 (not (= 1 |old(~a24~0)|))) (.cse1 (not (= 8 |old(~a21~0)|))) (.cse32 (<= ~a12~0 80)) (.cse28 (< 80 |old(~a12~0)|)) (.cse12 (not .cse16))) (and (or .cse0 .cse1 .cse2 (< 73282 |old(~a12~0)|) (and .cse3 .cse4 .cse5 .cse6 .cse7)) (or (and .cse3 .cse8 .cse4 .cse5) (< 0 (+ |old(~a12~0)| 460233)) .cse2 (< 8 |old(~a15~0)|) .cse9) (or .cse10 (not (= 6 |old(~a21~0)|)) .cse2 (not (= 5 |old(~a15~0)|))) (or (<= 10 ~a21~0) .cse11 .cse12) (or .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse9 .cse18) (or (or .cse19 .cse0) (and .cse20 (and .cse3 .cse8 .cse5 .cse6)) .cse2) (or .cse10 .cse11 .cse16 .cse2 .cse17) (or .cse21 .cse12 (and .cse7 .cse14)) (or (not .cse22) (and .cse3 .cse4 .cse6 (= 10 ~a21~0)) .cse2 .cse0 .cse23) (or .cse24 .cse18 .cse16 .cse17) (or .cse25 .cse11 .cse26 .cse2 .cse27) (or .cse28 .cse21 .cse2 .cse0 .cse29 .cse22) (or (and .cse3 .cse4 .cse5 .cse7 .cse30) .cse25 .cse2 .cse27 .cse1) (or .cse2 .cse12 .cse19 (and .cse3 .cse8 (= 7 ~a15~0) .cse4 .cse5)) (or .cse21 .cse16 .cse18 .cse17 .cse22) (or .cse26 (or .cse25 .cse2) (< 72 |old(~a12~0)|) (<= |old(~a12~0)| 18) .cse1) (or .cse25 .cse2 (< 95434 |old(~a12~0)|) .cse26 (<= |old(~a12~0)| 95380)) (or (< |old(~a21~0)| 9) .cse25 .cse2 .cse23 .cse26) (or .cse29 .cse0 .cse2 .cse27) (or .cse15 (and (<= ~a12~0 |old(~a12~0)|) .cse8 .cse14) .cse16 .cse17) (or .cse15 .cse12 (<= (+ ~a12~0 49) 0)) (or .cse24 .cse31 .cse26 .cse25 .cse2) (or .cse13 .cse32 .cse28) (or .cse31 .cse26 .cse25 .cse2 .cse1) (or (and .cse32 .cse14) .cse28 .cse12)))) [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-14 17:44:53,398 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-09-14 17:44:53,399 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-09-14 17:44:53,400 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-14 17:44:53,401 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-14 17:44:53,402 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-14 17:44:53,403 INFO L426 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-14 17:44:53,404 INFO L426 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,405 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-09-14 17:44:53,406 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-09-14 17:44:53,407 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,408 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-09-14 17:44:53,409 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 17:44:53,410 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a21~0 7) (<= 7 ~a21~0) (= 1 ~a24~0) (= 8 ~a15~0) (<= (+ ~a12~0 49) 0)) [2018-09-14 17:44:53,411 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 17:44:53,411 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 17:44:53,411 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (< 0 (+ |old(~a12~0)| 49)) (not (= 8 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= 7 ~a21~0) (= |old(~a15~0)| ~a15~0) (= 1 ~a24~0))) [2018-09-14 17:44:53,411 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-09-14 17:44:53,411 INFO L422 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse16 (= 10 ~a21~0))) (let ((.cse1 (not .cse16)) (.cse0 (not (= 8 |old(~a15~0)|))) (.cse6 (= 9 ~a15~0)) (.cse5 (= 6 ~a21~0)) (.cse7 (= 1 ~a24~0))) (let ((.cse4 (<= ~a12~0 80)) (.cse10 (<= ~a21~0 6)) (.cse17 (and .cse7 (<= ~a15~0 8))) (.cse18 (<= 81 ~a12~0)) (.cse11 (= ~a21~0 8)) (.cse12 (and .cse1 .cse7 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse0) (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|))) .cse6 (not .cse5))) (.cse14 (< 80 ~a12~0)) (.cse15 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 |old(~a24~0)|)) (.cse13 (<= ~a12~0 11)) (.cse19 (= 7 ~a21~0)) (.cse9 (= 7 ~a15~0)) (.cse8 (<= ~a15~0 7)) (.cse3 (<= 8 ~a21~0))) (or .cse0 (and .cse1 .cse2 (and .cse3 (and .cse4 (<= ~a15~0 |old(~a15~0)|)))) (and .cse5 (<= ~a12~0 95434) .cse6 .cse7 (< 95380 ~a12~0)) (and .cse8 (<= (+ ~a12~0 49) 0)) (and .cse7 .cse8 .cse3) (and .cse9 .cse2 .cse10) (and .cse5 .cse7 (= 5 ~a15~0)) (and (and .cse11 .cse12) (< 18 ~a12~0) (<= ~a12~0 72)) (and .cse2 .cse11 (= ~a15~0 9) .cse13) (and .cse4 .cse9) (and .cse2 (and .cse10 (= ~a15~0 |old(~a15~0)|))) (< 0 (+ |old(~a12~0)| 49)) (and .cse14 (and .cse15 .cse2 .cse6)) (and .cse16 .cse14 .cse17) (and (<= ~a12~0 73282) .cse11 .cse17) (< 7 |old(~a21~0)|) (and .cse7 (= 8 ~a15~0) .cse13) (= 6 ~a15~0) (and .cse9 .cse3) (and .cse18 (and .cse19 .cse2 .cse6)) (< |old(~a21~0)| 7) (and .cse18 .cse11 .cse12) (and (<= 9 ~a21~0) .cse12 .cse14) (and (and .cse15 .cse6) .cse2 .cse13) (and .cse19 .cse8 (not .cse9)) (and .cse1 .cse8 .cse3) (not (= 1 |old(~a24~0)|)))))) [2018-09-14 17:44:53,412 INFO L426 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-09-14 17:44:53,412 INFO L426 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-09-14 17:44:53,412 INFO L426 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-09-14 17:44:53,412 INFO L422 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse16 (= 10 ~a21~0))) (let ((.cse1 (not .cse16)) (.cse0 (not (= 8 |old(~a15~0)|))) (.cse6 (= 9 ~a15~0)) (.cse5 (= 6 ~a21~0)) (.cse7 (= 1 ~a24~0))) (let ((.cse4 (<= ~a12~0 80)) (.cse10 (<= ~a21~0 6)) (.cse17 (and .cse7 (<= ~a15~0 8))) (.cse18 (<= 81 ~a12~0)) (.cse11 (= ~a21~0 8)) (.cse12 (and .cse1 .cse7 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse0) (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|))) .cse6 (not .cse5))) (.cse14 (< 80 ~a12~0)) (.cse15 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 |old(~a24~0)|)) (.cse13 (<= ~a12~0 11)) (.cse19 (= 7 ~a21~0)) (.cse9 (= 7 ~a15~0)) (.cse8 (<= ~a15~0 7)) (.cse3 (<= 8 ~a21~0))) (or .cse0 (and .cse1 .cse2 (and .cse3 (and .cse4 (<= ~a15~0 |old(~a15~0)|)))) (and .cse5 (<= ~a12~0 95434) .cse6 .cse7 (< 95380 ~a12~0)) (and .cse8 (<= (+ ~a12~0 49) 0)) (and .cse7 .cse8 .cse3) (and .cse9 .cse2 .cse10) (and .cse5 .cse7 (= 5 ~a15~0)) (and (and .cse11 .cse12) (< 18 ~a12~0) (<= ~a12~0 72)) (and .cse2 .cse11 (= ~a15~0 9) .cse13) (and .cse4 .cse9) (and .cse2 (and .cse10 (= ~a15~0 |old(~a15~0)|))) (< 0 (+ |old(~a12~0)| 49)) (and .cse14 (and .cse15 .cse2 .cse6)) (and .cse16 .cse14 .cse17) (and (<= ~a12~0 73282) .cse11 .cse17) (< 7 |old(~a21~0)|) (and .cse7 (= 8 ~a15~0) .cse13) (= 6 ~a15~0) (and .cse9 .cse3) (and .cse18 (and .cse19 .cse2 .cse6)) (< |old(~a21~0)| 7) (and .cse18 .cse11 .cse12) (and (<= 9 ~a21~0) .cse12 .cse14) (and (and .cse15 .cse6) .cse2 .cse13) (and .cse19 .cse8 (not .cse9)) (and .cse1 .cse8 .cse3) (not (= 1 |old(~a24~0)|)))))) [2018-09-14 17:44:53,412 INFO L426 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-09-14 17:44:53,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:44:53 BoogieIcfgContainer [2018-09-14 17:44:53,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:44:53,446 INFO L168 Benchmark]: Toolchain (without parser) took 190936.87 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,446 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 17:44:53,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,448 INFO L168 Benchmark]: Boogie Preprocessor took 286.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,449 INFO L168 Benchmark]: RCFGBuilder took 3690.92 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: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,449 INFO L168 Benchmark]: TraceAbstraction took 185971.74 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-14 17:44:53,458 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 286.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3690.92 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: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185971.74 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8 == \old(a15)) || ((!(10 == a21) && a24 == \old(a24)) && 8 <= a21 && a12 <= 80 && a15 <= \old(a15))) || ((((6 == a21 && a12 <= 95434) && 9 == a15) && 1 == a24) && 95380 < a12)) || (a15 <= 7 && a12 + 49 <= 0)) || ((1 == a24 && a15 <= 7) && 8 <= a21)) || ((7 == a15 && a24 == \old(a24)) && a21 <= 6)) || ((6 == a21 && 1 == a24) && 5 == a15)) || (((a21 == 8 && ((((!(10 == a21) && 1 == a24) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (!(6 == \old(a21)) || !(5 == \old(a15)))) && 9 == a15) && !(6 == a21)) && 18 < a12) && a12 <= 72)) || (((a24 == \old(a24) && a21 == 8) && a15 == 9) && a12 <= 11)) || (a12 <= 80 && 7 == a15)) || (a24 == \old(a24) && a21 <= 6 && a15 == \old(a15))) || 0 < \old(a12) + 49) || (80 < a12 && (10 <= a21 && a24 == \old(a24)) && 9 == a15)) || ((10 == a21 && 80 < a12) && 1 == a24 && a15 <= 8)) || ((a12 <= 73282 && a21 == 8) && 1 == a24 && a15 <= 8)) || 7 < \old(a21)) || ((1 == a24 && 8 == a15) && a12 <= 11)) || 6 == a15) || (7 == a15 && 8 <= a21)) || (81 <= a12 && (7 == a21 && a24 == \old(a24)) && 9 == a15)) || \old(a21) < 7) || ((81 <= a12 && a21 == 8) && ((((!(10 == a21) && 1 == a24) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (!(6 == \old(a21)) || !(5 == \old(a15)))) && 9 == a15) && !(6 == a21))) || ((9 <= a21 && ((((!(10 == a21) && 1 == a24) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (!(6 == \old(a21)) || !(5 == \old(a15)))) && 9 == a15) && !(6 == a21)) && 80 < a12)) || (((10 <= a21 && 9 == a15) && a24 == \old(a24)) && a12 <= 11)) || ((7 == a21 && a15 <= 7) && !(7 == a15))) || ((!(10 == a21) && a15 <= 7) && 8 <= a21)) || !(1 == \old(a24)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 185.8s OverallTime, 19 OverallIterations, 14 TraceHistogramMax, 91.3s AutomataDifference, 0.0s DeadEndRemovalTime, 13.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1813 SDtfs, 42744 SDslu, 3790 SDs, 0 SdLazy, 60649 SolverSat, 6185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40524 GetRequests, 39844 SyntacticMatches, 100 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10735 ImplicationChecksByTransitivity, 38.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6382occurred in iteration=7, 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: 1.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 3404 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 540 PreInvPairs, 762 NumberOfFragments, 1537 HoareAnnotationTreeSize, 540 FomulaSimplifications, 180565 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 134619 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 56.5s InterpolantComputationTime, 30935 NumberOfCodeBlocks, 30935 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 50781 ConstructedInterpolants, 12 QuantifiedInterpolants, 173310144 SizeOfPredicates, 78 NumberOfNonLiveVariables, 28845 ConjunctsInSsa, 404 ConjunctsInUnsatCore, 77 InterpolantComputations, 9 PerfectInterpolantSequences, 127701/145061 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-44-53-495.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-44-53-495.csv Received shutdown request...