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/Problem02_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 10:10:02,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 10:10:02,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 10:10:02,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 10:10:02,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 10:10:02,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 10:10:02,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 10:10:02,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 10:10:02,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 10:10:02,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 10:10:02,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 10:10:02,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 10:10:02,193 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 10:10:02,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 10:10:02,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 10:10:02,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 10:10:02,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 10:10:02,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 10:10:02,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 10:10:02,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 10:10:02,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 10:10:02,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 10:10:02,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 10:10:02,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 10:10:02,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 10:10:02,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 10:10:02,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 10:10:02,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 10:10:02,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 10:10:02,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 10:10:02,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 10:10:02,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 10:10:02,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 10:10:02,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 10:10:02,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 10:10:02,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 10:10:02,230 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-18 10:10:02,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 10:10:02,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 10:10:02,253 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 10:10:02,256 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 10:10:02,256 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 10:10:02,256 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 10:10:02,256 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 10:10:02,256 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 10:10:02,257 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 10:10:02,257 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 10:10:02,257 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 10:10:02,257 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 10:10:02,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 10:10:02,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 10:10:02,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 10:10:02,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 10:10:02,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 10:10:02,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 10:10:02,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 10:10:02,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 10:10:02,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 10:10:02,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 10:10:02,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 10:10:02,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 10:10:02,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:10:02,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 10:10:02,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 10:10:02,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 10:10:02,264 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 10:10:02,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 10:10:02,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 10:10:02,264 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 10:10:02,265 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 10:10:02,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 10:10:02,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 10:10:02,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 10:10:02,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 10:10:02,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 10:10:02,364 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 10:10:02,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-18 10:10:02,733 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fac84b66/368bac02ef0c41cfbe258349c3310dcb/FLAG7b72a8731 [2018-09-18 10:10:03,025 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 10:10:03,026 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-18 10:10:03,040 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fac84b66/368bac02ef0c41cfbe258349c3310dcb/FLAG7b72a8731 [2018-09-18 10:10:03,062 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fac84b66/368bac02ef0c41cfbe258349c3310dcb [2018-09-18 10:10:03,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 10:10:03,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 10:10:03,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 10:10:03,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 10:10:03,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 10:10:03,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:03,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2aa5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03, skipping insertion in model container [2018-09-18 10:10:03,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:03,100 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 10:10:03,589 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:10:03,612 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 10:10:03,779 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:10:03,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03 WrapperNode [2018-09-18 10:10:03,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 10:10:03,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 10:10:03,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 10:10:03,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 10:10:03,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:03,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:03,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 10:10:03,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 10:10:03,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 10:10:03,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 10:10:04,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... [2018-09-18 10:10:04,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 10:10:04,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 10:10:04,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 10:10:04,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 10:10:04,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:10:04,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 10:10:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 10:10:04,257 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 10:10:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 10:10:04,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 10:10:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 10:10:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 10:10:04,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 10:10:07,575 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 10:10:07,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:10:07 BoogieIcfgContainer [2018-09-18 10:10:07,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 10:10:07,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 10:10:07,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 10:10:07,580 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 10:10:07,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 10:10:03" (1/3) ... [2018-09-18 10:10:07,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e071ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:10:07, skipping insertion in model container [2018-09-18 10:10:07,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:10:03" (2/3) ... [2018-09-18 10:10:07,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e071ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:10:07, skipping insertion in model container [2018-09-18 10:10:07,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:10:07" (3/3) ... [2018-09-18 10:10:07,587 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-09-18 10:10:07,599 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 10:10:07,608 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 10:10:07,664 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 10:10:07,664 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 10:10:07,665 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 10:10:07,665 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 10:10:07,665 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 10:10:07,665 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 10:10:07,666 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 10:10:07,666 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 10:10:07,666 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 10:10:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-18 10:10:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-18 10:10:07,709 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:07,711 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:07,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-09-18 10:10:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:07,786 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:08,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:08,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:10:08,349 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:08,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:10:08,371 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:10:08,372 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:10:08,375 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-18 10:10:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:10,175 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-09-18 10:10:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:10:10,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-09-18 10:10:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:10,197 INFO L225 Difference]: With dead ends: 627 [2018-09-18 10:10:10,197 INFO L226 Difference]: Without dead ends: 388 [2018-09-18 10:10:10,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:10:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-09-18 10:10:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-09-18 10:10:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-18 10:10:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-09-18 10:10:10,293 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-09-18 10:10:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:10,294 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-09-18 10:10:10,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:10:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-09-18 10:10:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-18 10:10:10,303 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:10,303 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:10,304 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-09-18 10:10:10,304 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:10,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:10,306 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:10,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:10,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:10:10,746 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:10,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:10,748 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:10,748 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:10,749 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-09-18 10:10:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:12,377 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-09-18 10:10:12,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:12,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-09-18 10:10:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:12,383 INFO L225 Difference]: With dead ends: 905 [2018-09-18 10:10:12,383 INFO L226 Difference]: Without dead ends: 382 [2018-09-18 10:10:12,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-18 10:10:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-18 10:10:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-18 10:10:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-09-18 10:10:12,414 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-09-18 10:10:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:12,415 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-09-18 10:10:12,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-09-18 10:10:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-18 10:10:12,420 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:12,420 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:12,421 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-09-18 10:10:12,421 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:12,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:12,423 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:12,625 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:12,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:10:12,625 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:12,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:10:12,626 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:10:12,627 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:10:12,627 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-09-18 10:10:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:15,199 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-09-18 10:10:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 10:10:15,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-09-18 10:10:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:15,209 INFO L225 Difference]: With dead ends: 1241 [2018-09-18 10:10:15,209 INFO L226 Difference]: Without dead ends: 865 [2018-09-18 10:10:15,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:10:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-09-18 10:10:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-09-18 10:10:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-09-18 10:10:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-09-18 10:10:15,302 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-09-18 10:10:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:15,303 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-09-18 10:10:15,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:10:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-09-18 10:10:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-18 10:10:15,307 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:15,307 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:15,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-09-18 10:10:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:15,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:15,309 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:15,558 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:15,582 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:15,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:10:15,582 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:15,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:10:15,583 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:10:15,583 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:10:15,584 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-09-18 10:10:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:17,640 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-09-18 10:10:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:10:17,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-09-18 10:10:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:17,655 INFO L225 Difference]: With dead ends: 2297 [2018-09-18 10:10:17,655 INFO L226 Difference]: Without dead ends: 1485 [2018-09-18 10:10:17,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:10:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-09-18 10:10:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-09-18 10:10:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-09-18 10:10:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-09-18 10:10:17,709 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-09-18 10:10:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:17,710 INFO L480 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-09-18 10:10:17,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:10:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-09-18 10:10:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-18 10:10:17,717 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:17,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:17,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-09-18 10:10:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:17,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:17,719 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:18,020 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:18,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:10:18,020 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:18,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:18,021 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:18,021 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:18,022 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-09-18 10:10:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:19,156 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-09-18 10:10:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:19,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-09-18 10:10:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:19,175 INFO L225 Difference]: With dead ends: 3050 [2018-09-18 10:10:19,176 INFO L226 Difference]: Without dead ends: 1430 [2018-09-18 10:10:19,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-09-18 10:10:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-09-18 10:10:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-09-18 10:10:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-09-18 10:10:19,229 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-09-18 10:10:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:19,230 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-09-18 10:10:19,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-09-18 10:10:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-18 10:10:19,236 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:19,236 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:19,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-09-18 10:10:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:19,238 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:19,453 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:19,453 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:19,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:19,462 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:19,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:20,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:20,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:20,869 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-18 10:10:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:20,899 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:21,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:21,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:21,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:10:21,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 16 [2018-09-18 10:10:21,343 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:10:21,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-18 10:10:21,348 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-18 10:10:21,349 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:10:21,349 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 13 states. [2018-09-18 10:10:22,285 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-18 10:10:22,621 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-18 10:10:25,173 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-18 10:10:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:31,451 INFO L93 Difference]: Finished difference Result 6056 states and 12507 transitions. [2018-09-18 10:10:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-18 10:10:31,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 163 [2018-09-18 10:10:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:31,526 INFO L225 Difference]: With dead ends: 6056 [2018-09-18 10:10:31,526 INFO L226 Difference]: Without dead ends: 4632 [2018-09-18 10:10:31,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 676 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=706, Invalid=2050, Unknown=0, NotChecked=0, Total=2756 [2018-09-18 10:10:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2018-09-18 10:10:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4060. [2018-09-18 10:10:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2018-09-18 10:10:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5628 transitions. [2018-09-18 10:10:31,793 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5628 transitions. Word has length 163 [2018-09-18 10:10:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:31,793 INFO L480 AbstractCegarLoop]: Abstraction has 4060 states and 5628 transitions. [2018-09-18 10:10:31,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-18 10:10:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5628 transitions. [2018-09-18 10:10:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-18 10:10:31,816 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:31,817 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:31,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2071604915, now seen corresponding path program 1 times [2018-09-18 10:10:31,818 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:31,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:31,819 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 10:10:32,079 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:32,079 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:32,087 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:32,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-18 10:10:32,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-18 10:10:32,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 10:10:32,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2018-09-18 10:10:32,674 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:32,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 10:10:32,675 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 10:10:32,675 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:32,676 INFO L87 Difference]: Start difference. First operand 4060 states and 5628 transitions. Second operand 4 states. [2018-09-18 10:10:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:34,361 INFO L93 Difference]: Finished difference Result 11341 states and 16156 transitions. [2018-09-18 10:10:34,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:34,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-09-18 10:10:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:34,402 INFO L225 Difference]: With dead ends: 11341 [2018-09-18 10:10:34,402 INFO L226 Difference]: Without dead ends: 7287 [2018-09-18 10:10:34,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2018-09-18 10:10:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 7268. [2018-09-18 10:10:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7268 states. [2018-09-18 10:10:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 10080 transitions. [2018-09-18 10:10:34,635 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 10080 transitions. Word has length 164 [2018-09-18 10:10:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 7268 states and 10080 transitions. [2018-09-18 10:10:34,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 10:10:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 10080 transitions. [2018-09-18 10:10:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-18 10:10:34,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:34,664 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:34,665 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -784995276, now seen corresponding path program 1 times [2018-09-18 10:10:34,665 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:34,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:34,667 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-18 10:10:35,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:35,126 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:35,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:35,136 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:35,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-18 10:10:35,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-18 10:10:35,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 10:10:35,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-18 10:10:35,580 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:35,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:35,581 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:35,581 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-09-18 10:10:35,581 INFO L87 Difference]: Start difference. First operand 7268 states and 10080 transitions. Second operand 5 states. [2018-09-18 10:10:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:36,658 INFO L93 Difference]: Finished difference Result 18038 states and 26600 transitions. [2018-09-18 10:10:36,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 10:10:36,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-09-18 10:10:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:36,718 INFO L225 Difference]: With dead ends: 18038 [2018-09-18 10:10:36,718 INFO L226 Difference]: Without dead ends: 10776 [2018-09-18 10:10:36,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 10:10:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2018-09-18 10:10:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 10333. [2018-09-18 10:10:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10333 states. [2018-09-18 10:10:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10333 states to 10333 states and 13655 transitions. [2018-09-18 10:10:37,106 INFO L78 Accepts]: Start accepts. Automaton has 10333 states and 13655 transitions. Word has length 179 [2018-09-18 10:10:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:37,106 INFO L480 AbstractCegarLoop]: Abstraction has 10333 states and 13655 transitions. [2018-09-18 10:10:37,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10333 states and 13655 transitions. [2018-09-18 10:10:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-18 10:10:37,140 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:37,140 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:37,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1700307470, now seen corresponding path program 1 times [2018-09-18 10:10:37,141 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:37,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:37,142 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:37,374 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-18 10:10:37,724 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:37,724 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:37,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:37,734 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:37,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-18 10:10:37,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-18 10:10:38,202 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 10:10:38,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 10:10:38,202 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:38,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:38,203 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:38,203 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 10:10:38,203 INFO L87 Difference]: Start difference. First operand 10333 states and 13655 transitions. Second operand 5 states. [2018-09-18 10:10:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:39,684 INFO L93 Difference]: Finished difference Result 21968 states and 29351 transitions. [2018-09-18 10:10:39,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:10:39,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-09-18 10:10:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:39,727 INFO L225 Difference]: With dead ends: 21968 [2018-09-18 10:10:39,727 INFO L226 Difference]: Without dead ends: 11641 [2018-09-18 10:10:39,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-18 10:10:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11641 states. [2018-09-18 10:10:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11641 to 11584. [2018-09-18 10:10:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11584 states. [2018-09-18 10:10:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11584 states to 11584 states and 14973 transitions. [2018-09-18 10:10:40,047 INFO L78 Accepts]: Start accepts. Automaton has 11584 states and 14973 transitions. Word has length 236 [2018-09-18 10:10:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:40,048 INFO L480 AbstractCegarLoop]: Abstraction has 11584 states and 14973 transitions. [2018-09-18 10:10:40,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 11584 states and 14973 transitions. [2018-09-18 10:10:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-18 10:10:40,080 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:40,080 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:40,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash -326102629, now seen corresponding path program 1 times [2018-09-18 10:10:40,081 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:40,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:40,082 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 153 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-18 10:10:40,471 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:40,471 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:40,480 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:40,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:40,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-18 10:10:40,950 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:40,950 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:10:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:40,966 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:41,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:41,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-18 10:10:42,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:10:42,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 5, 5] total 23 [2018-09-18 10:10:42,014 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:10:42,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-18 10:10:42,015 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-18 10:10:42,015 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-09-18 10:10:42,016 INFO L87 Difference]: Start difference. First operand 11584 states and 14973 transitions. Second operand 15 states. [2018-09-18 10:10:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:45,771 INFO L93 Difference]: Finished difference Result 22381 states and 28948 transitions. [2018-09-18 10:10:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-18 10:10:45,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 244 [2018-09-18 10:10:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:45,794 INFO L225 Difference]: With dead ends: 22381 [2018-09-18 10:10:45,794 INFO L226 Difference]: Without dead ends: 7800 [2018-09-18 10:10:45,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 980 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2018-09-18 10:10:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2018-09-18 10:10:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 7150. [2018-09-18 10:10:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7150 states. [2018-09-18 10:10:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 8621 transitions. [2018-09-18 10:10:45,992 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 8621 transitions. Word has length 244 [2018-09-18 10:10:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 7150 states and 8621 transitions. [2018-09-18 10:10:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-18 10:10:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 8621 transitions. [2018-09-18 10:10:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-18 10:10:46,008 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:46,009 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 10:10:46,009 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 623655535, now seen corresponding path program 1 times [2018-09-18 10:10:46,010 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:46,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:46,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:46,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:46,011 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:46,250 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-18 10:10:46,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:46,613 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:46,629 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:46,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-18 10:10:46,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-18 10:10:47,052 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:47,053 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:10:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:47,069 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:47,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-18 10:10:47,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-18 10:10:47,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:10:47,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-18 10:10:47,405 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:10:47,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 10:10:47,406 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 10:10:47,406 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 10:10:47,406 INFO L87 Difference]: Start difference. First operand 7150 states and 8621 transitions. Second operand 9 states. [2018-09-18 10:10:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:48,382 INFO L93 Difference]: Finished difference Result 13431 states and 16297 transitions. [2018-09-18 10:10:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 10:10:48,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2018-09-18 10:10:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:48,398 INFO L225 Difference]: With dead ends: 13431 [2018-09-18 10:10:48,399 INFO L226 Difference]: Without dead ends: 6432 [2018-09-18 10:10:48,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 979 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:10:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-09-18 10:10:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 6396. [2018-09-18 10:10:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2018-09-18 10:10:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 7524 transitions. [2018-09-18 10:10:48,546 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 7524 transitions. Word has length 246 [2018-09-18 10:10:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 6396 states and 7524 transitions. [2018-09-18 10:10:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 10:10:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 7524 transitions. [2018-09-18 10:10:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-18 10:10:48,563 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:48,563 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:48,563 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:48,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1812013721, now seen corresponding path program 1 times [2018-09-18 10:10:48,564 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:48,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:48,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:48,565 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 54 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-18 10:10:49,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:49,023 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:49,044 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:49,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:49,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:49,964 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-18 10:10:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 180 proven. 36 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-18 10:10:50,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:50,360 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:10:50,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:50,375 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:50,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:50,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 180 proven. 36 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-18 10:10:50,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:10:50,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-18 10:10:50,832 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:10:50,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 10:10:50,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 10:10:50,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-18 10:10:50,833 INFO L87 Difference]: Start difference. First operand 6396 states and 7524 transitions. Second operand 9 states. [2018-09-18 10:10:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:53,512 INFO L93 Difference]: Finished difference Result 14807 states and 17652 transitions. [2018-09-18 10:10:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-18 10:10:53,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 250 [2018-09-18 10:10:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:53,533 INFO L225 Difference]: With dead ends: 14807 [2018-09-18 10:10:53,533 INFO L226 Difference]: Without dead ends: 7567 [2018-09-18 10:10:53,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-09-18 10:10:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2018-09-18 10:10:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 5198. [2018-09-18 10:10:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2018-09-18 10:10:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 5639 transitions. [2018-09-18 10:10:53,673 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 5639 transitions. Word has length 250 [2018-09-18 10:10:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:53,673 INFO L480 AbstractCegarLoop]: Abstraction has 5198 states and 5639 transitions. [2018-09-18 10:10:53,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 10:10:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 5639 transitions. [2018-09-18 10:10:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-18 10:10:53,685 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:53,686 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:53,686 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2002622650, now seen corresponding path program 1 times [2018-09-18 10:10:53,686 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:53,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:53,687 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:53,972 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 235 proven. 62 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-09-18 10:10:54,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:54,829 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-18 10:10:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:54,836 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:54,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:55,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 10:10:55,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:55,449 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:10:55,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:55,464 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:55,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:10:55,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 10:10:56,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:10:56,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 13 [2018-09-18 10:10:56,009 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:10:56,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-18 10:10:56,010 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-18 10:10:56,010 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-18 10:10:56,011 INFO L87 Difference]: Start difference. First operand 5198 states and 5639 transitions. Second operand 11 states. [2018-09-18 10:10:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:58,475 INFO L93 Difference]: Finished difference Result 9450 states and 10241 transitions. [2018-09-18 10:10:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-18 10:10:58,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2018-09-18 10:10:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:58,476 INFO L225 Difference]: With dead ends: 9450 [2018-09-18 10:10:58,476 INFO L226 Difference]: Without dead ends: 0 [2018-09-18 10:10:58,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1165 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-09-18 10:10:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-18 10:10:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-18 10:10:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-18 10:10:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-18 10:10:58,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2018-09-18 10:10:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:58,490 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-18 10:10:58,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-18 10:10:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-18 10:10:58,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-18 10:10:58,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-18 10:10:58,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:58,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,522 WARN L178 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 208 [2018-09-18 10:10:59,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:59,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:11:00,087 WARN L178 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 208 [2018-09-18 10:11:00,641 WARN L178 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-18 10:11:00,753 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2018-09-18 10:11:04,999 WARN L178 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 281 DAG size of output: 93 [2018-09-18 10:11:06,739 WARN L178 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 197 DAG size of output: 89 [2018-09-18 10:11:08,315 WARN L178 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 197 DAG size of output: 89 [2018-09-18 10:11:08,318 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:11:08,318 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-09-18 10:11:08,318 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-18 10:11:08,319 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-18 10:11:08,320 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-18 10:11:08,321 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-18 10:11:08,322 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,323 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-18 10:11:08,324 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,325 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-18 10:11:08,326 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,327 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-18 10:11:08,328 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,329 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,330 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-18 10:11:08,331 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-18 10:11:08,332 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,333 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-18 10:11:08,334 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,335 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,336 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a25~0)|)) (.cse3 (= 9 |old(~a28~0)|)) (.cse24 (= |old(~a17~0)| ~a17~0)) (.cse17 (= |old(~a19~0)| ~a19~0)) (.cse26 (= ~a25~0 |old(~a25~0)|)) (.cse16 (= ~a11~0 |old(~a11~0)|)) (.cse18 (= ~a17~0 7)) (.cse25 (= ~a19~0 1)) (.cse19 (= ~a28~0 |old(~a28~0)|))) (let ((.cse15 (and .cse16 .cse18 .cse25 .cse19)) (.cse8 (not (= ~a25~0 1))) (.cse11 (not (= 7 |old(~a17~0)|))) (.cse13 (< |old(~a28~0)| 9)) (.cse23 (< 7 |old(~a28~0)|)) (.cse7 (and .cse16 .cse24 .cse17 .cse19 .cse26)) (.cse5 (< 0 |old(~a19~0)|)) (.cse27 (not .cse3)) (.cse12 (= |old(~a11~0)| |old(~a19~0)|)) (.cse21 (not .cse6)) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse1 (not (= 1 ~a21~0))) (.cse14 (and .cse16 .cse24 .cse25 .cse19 .cse26)) (.cse22 (< 0 |old(~a11~0)|)) (.cse0 (< 10 |old(~a28~0)|)) (.cse9 (not (= 1 |old(~a19~0)|))) (.cse2 (= 10 |old(~a28~0)|)) (.cse20 (= |old(~a17~0)| |old(~a28~0)|)) (.cse10 (= 8 |old(~a28~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse9 .cse10 .cse6 .cse11) (or (or .cse0 .cse1 .cse9 .cse12 .cse4) .cse13 .cse14) (or .cse1 .cse9 .cse10 .cse15 .cse6 .cse11) (or .cse1 (and .cse16 .cse17 .cse18 .cse19) .cse2 .cse20 .cse10 .cse12 .cse11) (or .cse14 (or .cse21 (or .cse1 .cse9 .cse22) .cse4)) (or .cse1 .cse23 .cse9 .cse15 .cse11) (or .cse1 (and .cse16 .cse8 .cse17 .cse18 .cse19) .cse20 .cse10 .cse12 .cse6 .cse11) (or .cse0 .cse1 .cse21 .cse13 .cse3 .cse22 .cse4 .cse7 .cse5) (or .cse1 .cse7 .cse3 .cse0 .cse2 .cse10 .cse4 .cse5) (or .cse21 (and (and .cse16 .cse24 .cse25 .cse19) .cse26) (or .cse1 .cse23 .cse9 .cse4)) (or (or .cse1 .cse9 .cse4) .cse14 .cse27) (or .cse1 .cse7 .cse6 .cse12 .cse4 .cse5 .cse27) (or .cse14 (or .cse1 .cse21 .cse9 .cse20 .cse12 .cse4)) (or .cse1 (not .cse2) .cse21 .cse9 (and (= 1 ~a11~0) (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0) (= 10 ~a28~0)) .cse4 (not (= 1 |old(~a11~0)|))) (or .cse1 .cse14 .cse3 .cse22 .cse6 .cse0 .cse9 .cse2 .cse20 .cse10 (< 8 |old(~a17~0)|))))) [2018-09-18 10:11:08,336 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,336 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,336 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,336 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-18 10:11:08,337 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-18 10:11:08,338 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-18 10:11:08,339 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:11:08,340 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-18 10:11:08,341 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:11:08,342 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a19~0 1) (<= ~a11~0 0) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9)) (not (= ~a28~0 10))) [2018-09-18 10:11:08,342 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-18 10:11:08,343 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:11:08,343 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 9 |old(~a28~0)|) (< 0 |old(~a11~0)|) (= 1 |old(~a25~0)|) (< 10 |old(~a28~0)|) (not (= 1 |old(~a19~0)|)) (= 10 |old(~a28~0)|) (= |old(~a17~0)| |old(~a28~0)|) (= 8 |old(~a28~0)|) (< 8 |old(~a17~0)|)) [2018-09-18 10:11:08,343 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-18 10:11:08,343 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse16 (= 8 ~a17~0)) (.cse19 (= |old(~a17~0)| ~a17~0))) (let ((.cse8 (not (= ~a25~0 1))) (.cse6 (not (= ~a19~0 ~a11~0))) (.cse22 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse24 (or (not .cse16) .cse19)) (.cse25 (<= ~a17~0 8)) (.cse26 (= ~a21~0 1)) (.cse11 (not (= ~a28~0 10)))) (let ((.cse9 (= 9 ~a28~0)) (.cse13 (<= ~a28~0 7)) (.cse14 (and .cse22 .cse5 .cse24 .cse25 .cse26 .cse11)) (.cse15 (= 1 ~a11~0)) (.cse17 (= 1 ~a19~0)) (.cse7 (<= ~a19~0 0)) (.cse12 (not (= ~a28~0 9))) (.cse10 (<= ~a28~0 10)) (.cse21 (<= 9 ~a28~0)) (.cse23 (and .cse8 .cse22 .cse24 .cse25 .cse6 .cse26)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse18 (= ~a17~0 7)) (.cse0 (= 1 ~a25~0)) (.cse1 (= |old(~a17~0)| 8)) (.cse3 (= ~a17~0 |old(~a17~0)|)) (.cse4 (= 7 |old(~a28~0)|)) (.cse20 (<= ~a11~0 0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse4 .cse9 .cse6) (< 0 |old(~a11~0)|) (and .cse7 .cse8 .cse10 .cse11 .cse1 .cse3 .cse4 .cse12) (and .cse0 (and .cse1 .cse13 .cse3 .cse4 .cse14)) (and .cse15 .cse0 .cse9 .cse16 .cse17) (and (and .cse1 .cse5 .cse3 .cse4) .cse9) (and .cse1 .cse13 .cse18 .cse4 .cse14) (and (and .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4) .cse12) (not (= 1 |old(~a19~0)|)) (and .cse15 .cse0 .cse16 .cse17 (= 10 ~a28~0)) (and .cse19 .cse5 .cse20 (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (< 7 |old(~a28~0)|) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse21 .cse20 .cse12) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse18 .cse4 .cse22 .cse6 .cse11) (and .cse1 .cse18 .cse4 .cse8 .cse22 .cse5) (= |old(~a17~0)| |old(~a28~0)|) (and (and .cse1 .cse3 .cse10 (and .cse23 .cse5)) (= |old(~a28~0)| 7) .cse21) (and .cse1 .cse23 .cse2 .cse18 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse20) (< 8 |old(~a17~0)|))))) [2018-09-18 10:11:08,343 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-18 10:11:08,343 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-18 10:11:08,344 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse16 (= 8 ~a17~0)) (.cse19 (= |old(~a17~0)| ~a17~0))) (let ((.cse8 (not (= ~a25~0 1))) (.cse6 (not (= ~a19~0 ~a11~0))) (.cse22 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse24 (or (not .cse16) .cse19)) (.cse25 (<= ~a17~0 8)) (.cse26 (= ~a21~0 1)) (.cse11 (not (= ~a28~0 10)))) (let ((.cse9 (= 9 ~a28~0)) (.cse13 (<= ~a28~0 7)) (.cse14 (and .cse22 .cse5 .cse24 .cse25 .cse26 .cse11)) (.cse15 (= 1 ~a11~0)) (.cse17 (= 1 ~a19~0)) (.cse7 (<= ~a19~0 0)) (.cse12 (not (= ~a28~0 9))) (.cse10 (<= ~a28~0 10)) (.cse21 (<= 9 ~a28~0)) (.cse23 (and .cse8 .cse22 .cse24 .cse25 .cse6 .cse26)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse18 (= ~a17~0 7)) (.cse0 (= 1 ~a25~0)) (.cse1 (= |old(~a17~0)| 8)) (.cse3 (= ~a17~0 |old(~a17~0)|)) (.cse4 (= 7 |old(~a28~0)|)) (.cse20 (<= ~a11~0 0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse4 .cse9 .cse6) (< 0 |old(~a11~0)|) (and .cse7 .cse8 .cse10 .cse11 .cse1 .cse3 .cse4 .cse12) (and .cse0 (and .cse1 .cse13 .cse3 .cse4 .cse14)) (and .cse15 .cse0 .cse9 .cse16 .cse17) (and (and .cse1 .cse5 .cse3 .cse4) .cse9) (and .cse1 .cse13 .cse18 .cse4 .cse14) (and (and .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4) .cse12) (not (= 1 |old(~a19~0)|)) (and .cse15 .cse0 .cse16 .cse17 (= 10 ~a28~0)) (and .cse19 .cse5 .cse20 (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (< 7 |old(~a28~0)|) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse21 .cse20 .cse12) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse18 .cse4 .cse22 .cse6 .cse11) (and .cse1 .cse18 .cse4 .cse8 .cse22 .cse5) (= |old(~a17~0)| |old(~a28~0)|) (and (and .cse1 .cse3 .cse10 (and .cse23 .cse5)) (= |old(~a28~0)| 7) .cse21) (and .cse1 .cse23 .cse2 .cse18 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse20) (< 8 |old(~a17~0)|))))) [2018-09-18 10:11:08,344 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-18 10:11:08,344 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-18 10:11:08,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 10:11:08 BoogieIcfgContainer [2018-09-18 10:11:08,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 10:11:08,382 INFO L168 Benchmark]: Toolchain (without parser) took 65305.73 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-18 10:11:08,384 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:11:08,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.36 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-18 10:11:08,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:11:08,385 INFO L168 Benchmark]: Boogie Preprocessor took 211.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-09-18 10:11:08,386 INFO L168 Benchmark]: RCFGBuilder took 3412.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. [2018-09-18 10:11:08,387 INFO L168 Benchmark]: TraceAbstraction took 60800.89 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 814.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -438.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-18 10:11:08,391 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.36 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3412.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60800.89 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 814.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -438.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == a21) || ((((((1 == a25 && \old(a17) == 8) && !(a28 == a17)) && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && !(a19 == a11))) || ((((((a19 <= 0 && !(a25 == 1)) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && 9 == a28) && !(a19 == a11))) || 0 < \old(a11)) || (((((((a19 <= 0 && !(a25 == 1)) && a28 <= 10) && !(a28 == 10)) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && !(a28 == 9))) || (1 == a25 && (((\old(a17) == 8 && a28 <= 7) && a17 == \old(a17)) && 7 == \old(a28)) && ((((!(a28 == 8) && a19 == 1) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && a21 == 1) && !(a28 == 10))) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || ((((\old(a17) == 8 && a19 == 1) && a17 == \old(a17)) && 7 == \old(a28)) && 9 == a28)) || ((((\old(a17) == 8 && a28 <= 7) && a17 == 7) && 7 == \old(a28)) && ((((!(a28 == 8) && a19 == 1) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && a21 == 1) && !(a28 == 10))) || (((((((a19 <= 0 && a28 <= 10) && !(a28 == 10)) && \old(a17) == 8) && !(a28 == a17)) && a17 == \old(a17)) && 7 == \old(a28)) && !(a28 == 9))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || ((((\old(a17) == a17 && a19 == 1) && a11 <= 0) && a28 == \old(a28)) && a25 == \old(a25))) || 7 < \old(a28)) || ((((((((a19 <= 0 && 1 == a25) && a28 <= 10) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && 9 <= a28) && a11 <= 0) && !(a28 == 9))) || 1 == \old(a25)) || ((((((\old(a17) == 8 && !(a28 == a17)) && a17 == 7) && 7 == \old(a28)) && !(a28 == 8)) && !(a19 == a11)) && !(a28 == 10))) || (((((\old(a17) == 8 && a17 == 7) && 7 == \old(a28)) && !(a25 == 1)) && !(a28 == 8)) && a19 == 1)) || \old(a17) == \old(a28)) || (((((\old(a17) == 8 && a17 == \old(a17)) && a28 <= 10) && (((((!(a25 == 1) && !(a28 == 8)) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && !(a19 == a11)) && a21 == 1) && a19 == 1) && \old(a28) == 7) && 9 <= a28)) || ((((\old(a17) == 8 && ((((!(a25 == 1) && !(a28 == 8)) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && !(a19 == a11)) && a21 == 1) && !(a28 == a17)) && a17 == 7) && 7 == \old(a28))) || (((((1 == a25 && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && a11 <= 0)) || 8 < \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 60.6s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 34.0s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1355 SDtfs, 14881 SDslu, 1875 SDs, 0 SdLazy, 18238 SolverSat, 4040 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6193 GetRequests, 5964 SyntacticMatches, 30 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11584occurred in iteration=9, 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.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4205 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 404 PreInvPairs, 514 NumberOfFragments, 1646 HoareAnnotationTreeSize, 404 FomulaSimplifications, 91202 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14919 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 5359 NumberOfCodeBlocks, 5359 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8287 ConstructedInterpolants, 0 QuantifiedInterpolants, 3953821 SizeOfPredicates, 9 NumberOfNonLiveVariables, 7084 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 39 InterpolantComputations, 8 PerfectInterpolantSequences, 6102/6899 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/Problem02_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_10-11-08-412.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_10-11-08-412.csv Received shutdown request...