java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/GuiTestExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:18:54,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:18:54,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:18:54,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:18:54,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:18:54,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:18:54,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:18:54,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:18:54,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:18:54,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:18:54,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:18:54,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:18:54,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:18:54,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:18:54,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:18:54,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:18:54,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:18:54,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:18:54,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:18:54,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:18:54,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:18:54,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:18:54,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:18:54,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:18:54,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:18:54,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:18:54,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:18:54,157 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:18:54,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:18:54,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:18:54,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:18:54,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:18:54,160 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:18:54,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:18:54,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:18:54,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:18:54,162 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-14 16:18:54,175 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:18:54,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:18:54,176 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:18:54,176 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:18:54,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:18:54,176 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:18:54,177 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:18:54,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:18:54,177 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:18:54,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:18:54,177 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:18:54,178 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:18:54,178 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:18:54,178 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:18:54,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:18:54,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:18:54,179 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:18:54,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:18:54,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:18:54,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:18:54,181 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:18:54,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:18:54,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:18:54,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:18:54,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:18:54,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:18:54,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:18:54,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:18:54,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:18:54,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:18:54,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:18:54,235 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:18:54,235 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:18:54,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl [2019-02-14 16:18:54,236 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl' [2019-02-14 16:18:54,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:18:54,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:18:54,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:18:54,331 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:18:54,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,396 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-14 16:18:54,396 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-14 16:18:54,396 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-14 16:18:54,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:18:54,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:18:54,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:18:54,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:18:54,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:18:54,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (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 [2019-02-14 16:18:54,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-02-14 16:18:54,673 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-14 16:18:54,673 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-14 16:18:54,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-02-14 16:18:54,674 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-14 16:18:54,674 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-14 16:18:54,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-02-14 16:18:54,674 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-14 16:18:54,674 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-14 16:18:54,675 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-02-14 16:18:54,675 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-14 16:18:54,675 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-14 16:18:54,676 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-02-14 16:18:54,676 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-14 16:18:54,676 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-14 16:18:54,676 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-02-14 16:18:54,676 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-02-14 16:18:54,677 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-02-14 16:18:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-14 16:18:54,677 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-14 16:18:54,677 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-02-14 16:18:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-14 16:18:54,677 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-14 16:18:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-02-14 16:18:54,683 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-02-14 16:18:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-14 16:18:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-14 16:18:54,684 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-02-14 16:18:54,684 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-14 16:18:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-14 16:18:54,684 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-02-14 16:18:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-14 16:18:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-14 16:18:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-02-14 16:18:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-02-14 16:18:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-02-14 16:18:54,685 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-02-14 16:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-14 16:18:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-14 16:18:54,686 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-02-14 16:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-14 16:18:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-14 16:18:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-02-14 16:18:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-02-14 16:18:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-02-14 16:18:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-02-14 16:18:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-02-14 16:18:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-02-14 16:18:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-02-14 16:18:54,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-02-14 16:18:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-14 16:18:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-14 16:18:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-02-14 16:18:54,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-02-14 16:18:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-14 16:18:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-14 16:18:54,690 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-02-14 16:18:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-02-14 16:18:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-02-14 16:18:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-02-14 16:18:54,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-02-14 16:18:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-02-14 16:18:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-02-14 16:18:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-02-14 16:18:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-02-14 16:18:55,005 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:55,123 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:55,197 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:55,277 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:55,981 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,002 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,012 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,017 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,108 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,127 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:56,211 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-14 16:18:57,020 INFO L278 CfgBuilder]: Using library mode [2019-02-14 16:18:57,021 INFO L286 CfgBuilder]: Removed 206 assue(true) statements. [2019-02-14 16:18:57,024 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:18:57 BoogieIcfgContainer [2019-02-14 16:18:57,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:18:57,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:18:57,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:18:57,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:18:57,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/2) ... [2019-02-14 16:18:57,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c9ef19 and model type GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:18:57, skipping insertion in model container [2019-02-14 16:18:57,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:18:57" (2/2) ... [2019-02-14 16:18:57,035 INFO L112 eAbstractionObserver]: Analyzing ICFG GuiTestExample.bpl [2019-02-14 16:18:57,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:18:57,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-02-14 16:18:57,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-02-14 16:18:57,110 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:18:57,111 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:18:57,111 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:18:57,111 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:18:57,111 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:18:57,111 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:18:57,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:18:57,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:18:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-02-14 16:18:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-14 16:18:57,143 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:57,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-14 16:18:57,149 INFO L423 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:18:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash 10434, now seen corresponding path program 1 times [2019-02-14 16:18:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:57,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:57,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:57,429 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-14 16:18:57,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume !($r110 != $null); {308#false} is VALID [2019-02-14 16:18:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:18:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:18:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-14 16:18:57,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:57,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:18:57,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:57,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:18:57,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:57,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:18:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:18:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:18:57,518 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-02-14 16:18:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:58,634 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-02-14 16:18:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:18:58,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:18:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:18:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-14 16:18:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-14 16:18:58,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2019-02-14 16:18:59,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:59,147 INFO L225 Difference]: With dead ends: 304 [2019-02-14 16:18:59,147 INFO L226 Difference]: Without dead ends: 252 [2019-02-14 16:18:59,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:18:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-02-14 16:18:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-02-14 16:18:59,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:18:59,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2019-02-14 16:18:59,257 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-14 16:18:59,257 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-14 16:18:59,257 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:18:59,282 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-14 16:18:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-14 16:18:59,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:59,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:59,286 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-14 16:18:59,286 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-14 16:18:59,286 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:18:59,304 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-14 16:18:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-14 16:18:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:59,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:59,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:18:59,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:18:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-14 16:18:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2019-02-14 16:18:59,331 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 2 [2019-02-14 16:18:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:18:59,334 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2019-02-14 16:18:59,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:18:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-14 16:18:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:18:59,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:59,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:18:59,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:18:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash 168844, now seen corresponding path program 1 times [2019-02-14 16:18:59,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:59,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:59,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:59,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:59,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:59,411 INFO L273 TraceCheckUtils]: 0: Hoare triple {1934#true} assume void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this != $null; {1936#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} is VALID [2019-02-14 16:18:59,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {1936#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} r093 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this;r194 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0;SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711 := r194; {1937#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-02-14 16:18:59,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {1937#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} assume !(r093 != $null); {1935#false} is VALID [2019-02-14 16:18:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:18:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:18:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:18:59,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:59,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:18:59,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:59,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:18:59,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:18:59,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:18:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:18:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:18:59,422 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 4 states. [2019-02-14 16:19:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:00,194 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-14 16:19:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:00,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-14 16:19:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-14 16:19:00,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2019-02-14 16:19:00,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:00,472 INFO L225 Difference]: With dead ends: 252 [2019-02-14 16:19:00,472 INFO L226 Difference]: Without dead ends: 248 [2019-02-14 16:19:00,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-14 16:19:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-02-14 16:19:00,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:00,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 248 states. [2019-02-14 16:19:00,514 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-14 16:19:00,514 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-14 16:19:00,515 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:00,525 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-14 16:19:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-14 16:19:00,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:00,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:00,527 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-14 16:19:00,528 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-14 16:19:00,528 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:00,538 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-14 16:19:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-14 16:19:00,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:00,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:00,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:00,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-14 16:19:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 254 transitions. [2019-02-14 16:19:00,548 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 254 transitions. Word has length 3 [2019-02-14 16:19:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:00,548 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 254 transitions. [2019-02-14 16:19:00,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-14 16:19:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:00,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:00,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:00,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash 181753, now seen corresponding path program 1 times [2019-02-14 16:19:00,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:00,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:00,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:00,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:00,604 INFO L273 TraceCheckUtils]: 0: Hoare triple {3492#true} assume void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this != $null; {3494#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} is VALID [2019-02-14 16:19:00,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {3494#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} r0120 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this;r1121 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0;SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763 := r1121; {3495#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-02-14 16:19:00,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {3495#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} assume !(r0120 != $null); {3493#false} is VALID [2019-02-14 16:19:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:00,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:00,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:00,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:00,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:00,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:00,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:00,640 INFO L87 Difference]: Start difference. First operand 248 states and 254 transitions. Second operand 4 states. [2019-02-14 16:19:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:01,183 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-14 16:19:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:01,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-14 16:19:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-14 16:19:01,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 254 transitions. [2019-02-14 16:19:01,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:01,554 INFO L225 Difference]: With dead ends: 248 [2019-02-14 16:19:01,554 INFO L226 Difference]: Without dead ends: 244 [2019-02-14 16:19:01,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-02-14 16:19:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-02-14 16:19:01,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:01,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 244 states. [2019-02-14 16:19:01,609 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-02-14 16:19:01,610 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-02-14 16:19:01,610 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:01,618 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-14 16:19:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-14 16:19:01,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:01,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:01,619 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-02-14 16:19:01,619 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-02-14 16:19:01,619 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:01,628 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-14 16:19:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-14 16:19:01,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:01,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:01,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:01,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-02-14 16:19:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 251 transitions. [2019-02-14 16:19:01,637 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 251 transitions. Word has length 3 [2019-02-14 16:19:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:01,638 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 251 transitions. [2019-02-14 16:19:01,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-14 16:19:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:01,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:01,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:01,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash 323784, now seen corresponding path program 1 times [2019-02-14 16:19:01,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:01,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:01,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:01,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:01,715 INFO L273 TraceCheckUtils]: 0: Hoare triple {5028#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {5030#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-14 16:19:01,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {5030#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume $r110 != $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this := $r110; {5031#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-14 16:19:01,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {5031#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} assume !(void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null); {5029#false} is VALID [2019-02-14 16:19:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:01,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:01,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:01,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:01,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:01,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:01,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:01,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:01,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:01,722 INFO L87 Difference]: Start difference. First operand 244 states and 251 transitions. Second operand 4 states. [2019-02-14 16:19:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:02,292 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-14 16:19:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:02,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-02-14 16:19:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-02-14 16:19:02,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 251 transitions. [2019-02-14 16:19:02,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:02,574 INFO L225 Difference]: With dead ends: 244 [2019-02-14 16:19:02,574 INFO L226 Difference]: Without dead ends: 243 [2019-02-14 16:19:02,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-14 16:19:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-02-14 16:19:02,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:02,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 243 states. [2019-02-14 16:19:02,799 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-14 16:19:02,799 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-14 16:19:02,799 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:02,807 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-14 16:19:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-14 16:19:02,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:02,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:02,808 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-14 16:19:02,809 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-14 16:19:02,809 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:02,817 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-14 16:19:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-14 16:19:02,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:02,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:02,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:02,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-14 16:19:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 250 transitions. [2019-02-14 16:19:02,826 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 250 transitions. Word has length 3 [2019-02-14 16:19:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:02,826 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 250 transitions. [2019-02-14 16:19:02,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-14 16:19:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:02,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:02,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:02,830 INFO L423 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 161893, now seen corresponding path program 1 times [2019-02-14 16:19:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:02,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:02,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:02,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:02,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:03,007 INFO L273 TraceCheckUtils]: 0: Hoare triple {6555#true} assume void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null; {6557#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-14 16:19:03,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {6557#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} r01 := void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this; {6558#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-02-14 16:19:03,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {6558#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} assume !(r01 != $null); {6556#false} is VALID [2019-02-14 16:19:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:03,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:03,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:03,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:03,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:03,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:03,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:03,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:03,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:03,017 INFO L87 Difference]: Start difference. First operand 243 states and 250 transitions. Second operand 4 states. [2019-02-14 16:19:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,148 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-14 16:19:04,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:04,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-14 16:19:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-14 16:19:04,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2019-02-14 16:19:04,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:04,390 INFO L225 Difference]: With dead ends: 243 [2019-02-14 16:19:04,390 INFO L226 Difference]: Without dead ends: 239 [2019-02-14 16:19:04,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-14 16:19:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-02-14 16:19:04,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:04,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2019-02-14 16:19:04,437 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-14 16:19:04,437 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-14 16:19:04,437 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:04,446 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-14 16:19:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-14 16:19:04,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,447 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-14 16:19:04,447 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-14 16:19:04,448 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:04,456 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-14 16:19:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-14 16:19:04,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:04,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-02-14 16:19:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 247 transitions. [2019-02-14 16:19:04,466 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 247 transitions. Word has length 3 [2019-02-14 16:19:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:04,466 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 247 transitions. [2019-02-14 16:19:04,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-14 16:19:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:04,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:04,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:04,472 INFO L423 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash 29824, now seen corresponding path program 1 times [2019-02-14 16:19:04,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:04,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:04,532 INFO L273 TraceCheckUtils]: 0: Hoare triple {8063#true} assume void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this != $null; {8065#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} is VALID [2019-02-14 16:19:04,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {8065#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} r0107 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this;r1108 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$param_0;SimpleFrame2Cons$SimpleFrame2Cons$3$this$0762 := r1108; {8066#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-02-14 16:19:04,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {8066#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} assume !(r0107 != $null); {8064#false} is VALID [2019-02-14 16:19:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:04,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:04,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:04,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:04,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:04,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:04,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:04,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:04,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:04,541 INFO L87 Difference]: Start difference. First operand 239 states and 247 transitions. Second operand 4 states. [2019-02-14 16:19:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:05,058 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-14 16:19:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:05,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:19:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-14 16:19:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-14 16:19:05,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2019-02-14 16:19:05,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:05,287 INFO L225 Difference]: With dead ends: 239 [2019-02-14 16:19:05,288 INFO L226 Difference]: Without dead ends: 235 [2019-02-14 16:19:05,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-14 16:19:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-02-14 16:19:05,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:05,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 235 states. [2019-02-14 16:19:05,309 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-14 16:19:05,309 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-14 16:19:05,310 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:05,316 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-14 16:19:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-14 16:19:05,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:05,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:05,318 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-14 16:19:05,318 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-14 16:19:05,318 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:05,324 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-14 16:19:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-14 16:19:05,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:05,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:05,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:05,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-14 16:19:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2019-02-14 16:19:05,330 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 3 [2019-02-14 16:19:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:05,330 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2019-02-14 16:19:05,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-14 16:19:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:19:05,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:05,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:19:05,333 INFO L423 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:05,333 INFO L82 PathProgramCache]: Analyzing trace with hash 6127075, now seen corresponding path program 1 times [2019-02-14 16:19:05,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:05,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:05,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:05,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:05,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:05,359 INFO L273 TraceCheckUtils]: 0: Hoare triple {9549#true} assume __this != $null; {9549#true} is VALID [2019-02-14 16:19:05,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {9549#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {9549#true} is VALID [2019-02-14 16:19:05,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {9549#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {9551#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-02-14 16:19:05,361 INFO L273 TraceCheckUtils]: 3: Hoare triple {9551#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {9550#false} is VALID [2019-02-14 16:19:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:05,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:05,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:05,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:05,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:19:05,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:05,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:19:05,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:05,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:19:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:19:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:19:05,369 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 3 states. [2019-02-14 16:19:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,209 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-14 16:19:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:19:06,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:19:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-14 16:19:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-14 16:19:06,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 244 transitions. [2019-02-14 16:19:06,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:06,508 INFO L225 Difference]: With dead ends: 235 [2019-02-14 16:19:06,508 INFO L226 Difference]: Without dead ends: 234 [2019-02-14 16:19:06,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:19:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-14 16:19:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-02-14 16:19:06,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:06,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 234 states. [2019-02-14 16:19:06,526 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-14 16:19:06,526 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-14 16:19:06,527 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:06,533 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-14 16:19:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-14 16:19:06,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,535 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-14 16:19:06,535 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-14 16:19:06,535 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:06,541 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-14 16:19:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-14 16:19:06,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:06,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-14 16:19:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2019-02-14 16:19:06,547 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 4 [2019-02-14 16:19:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:06,547 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2019-02-14 16:19:06,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:19:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-14 16:19:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:19:06,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:06,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:19:06,550 INFO L423 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1755747, now seen corresponding path program 1 times [2019-02-14 16:19:06,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,746 INFO L273 TraceCheckUtils]: 0: Hoare triple {11023#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-14 16:19:06,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-14 16:19:06,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {11026#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-02-14 16:19:06,748 INFO L273 TraceCheckUtils]: 3: Hoare triple {11026#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {11024#false} is VALID [2019-02-14 16:19:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:06,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:06,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:06,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:06,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:19:06,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:06,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:06,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:06,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:06,763 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand 4 states. [2019-02-14 16:19:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:07,778 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-14 16:19:07,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:07,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:19:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-14 16:19:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-14 16:19:07,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2019-02-14 16:19:08,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:08,267 INFO L225 Difference]: With dead ends: 234 [2019-02-14 16:19:08,268 INFO L226 Difference]: Without dead ends: 213 [2019-02-14 16:19:08,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:19:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-14 16:19:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-14 16:19:08,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:08,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 213 states. [2019-02-14 16:19:08,311 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-14 16:19:08,311 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-14 16:19:08,311 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:08,317 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-14 16:19:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-14 16:19:08,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,318 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-14 16:19:08,319 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-14 16:19:08,319 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-14 16:19:08,323 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-14 16:19:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-14 16:19:08,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:08,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-14 16:19:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2019-02-14 16:19:08,329 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 4 [2019-02-14 16:19:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:08,329 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2019-02-14 16:19:08,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-14 16:19:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:19:08,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:08,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:19:08,331 INFO L423 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-14 16:19:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash 179442176, now seen corresponding path program 1 times [2019-02-14 16:19:08,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-14 16:19:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-14 16:19:08,352 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-02-14 16:19:08,363 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885ENTRY has no Hoare annotation [2019-02-14 16:19:08,363 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$actionPerformed$4553ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$actionPerformed$4886ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807ENTRY has no Hoare annotation [2019-02-14 16:19:08,364 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803ENTRY has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888ENTRY has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804ENTRY has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $EFG_ProcedureENTRY has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,365 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806FINAL has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808FINAL has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807FINAL has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-14 16:19:08,366 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,367 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246FINAL has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809FINAL has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-14 16:19:08,368 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885FINAL has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802FINAL has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552FINAL has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-14 16:19:08,369 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887FINAL has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-14 16:19:08,370 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2019-02-14 16:19:08,371 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888FINAL has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L420-1 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804FINAL has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-14 16:19:08,372 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-14 16:19:08,373 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2019-02-14 16:19:08,374 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-14 16:19:08,375 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-14 16:19:08,376 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,377 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,378 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,379 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-14 16:19:08,380 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,381 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,382 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-14 16:19:08,383 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-14 16:19:08,384 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-14 16:19:08,385 WARN L170 areAnnotationChecker]: Event2_Block67 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: Event0_Block65 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: Event1_Block66 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-14 16:19:08,386 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-14 16:19:08,387 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-14 16:19:08,388 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-14 16:19:08,389 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-14 16:19:08,390 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,391 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805FINAL has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-14 16:19:08,392 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-14 16:19:08,393 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L753-1 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-14 16:19:08,394 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-14 16:19:08,395 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-14 16:19:08,396 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-14 16:19:08,396 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-14 16:19:08,396 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803FINAL has no Hoare annotation [2019-02-14 16:19:08,396 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-14 16:19:08,400 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:19:08 BoogieIcfgContainer [2019-02-14 16:19:08,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:19:08,402 INFO L168 Benchmark]: Toolchain (without parser) took 14073.15 ms. Allocated memory was 138.4 MB in the beginning and 360.2 MB in the end (delta: 221.8 MB). Free memory was 103.5 MB in the beginning and 217.8 MB in the end (delta: -114.3 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:08,404 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:19:08,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 97.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:08,406 INFO L168 Benchmark]: Boogie Preprocessor took 97.23 ms. Allocated memory is still 138.4 MB. Free memory was 97.6 MB in the beginning and 95.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:08,407 INFO L168 Benchmark]: RCFGBuilder took 2428.13 ms. Allocated memory was 138.4 MB in the beginning and 178.3 MB in the end (delta: 39.8 MB). Free memory was 95.1 MB in the beginning and 76.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:08,408 INFO L168 Benchmark]: TraceAbstraction took 11374.79 ms. Allocated memory was 178.3 MB in the beginning and 360.2 MB in the end (delta: 181.9 MB). Free memory was 75.4 MB in the beginning and 217.8 MB in the end (delta: -142.3 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:08,413 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 167.63 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 97.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.23 ms. Allocated memory is still 138.4 MB. Free memory was 97.6 MB in the beginning and 95.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2428.13 ms. Allocated memory was 138.4 MB in the beginning and 178.3 MB in the end (delta: 39.8 MB). Free memory was 95.1 MB in the beginning and 76.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11374.79 ms. Allocated memory was 178.3 MB in the beginning and 360.2 MB in the end (delta: 181.9 MB). Free memory was 75.4 MB in the beginning and 217.8 MB in the end (delta: -142.3 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 658]: assertion can be violated assertion can be violated We found a FailurePath: [L642] requires void$SimpleFrame2Cons$4$actionPerformed$4888$__this != $null; [L651] r0125 := void$SimpleFrame2Cons$4$actionPerformed$4888$__this; [L653] r1126 := void$SimpleFrame2Cons$4$actionPerformed$4888$param_0; [L655] $r2129 := SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763; [L390] r083 := $param_0; [L392] $r185 := javax.swing.JButton$SimpleFrame2Cons$event2227; [L394] __ret := $r185; [L658] assert $r3130 != $null; - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 304 locations, 87 error locations. UNSAFE Result, 11.2s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2003 SDtfs, 238 SDslu, 3261 SDs, 0 SdLazy, 26 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, 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: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...