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_array_oct.epf -i ../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:56:29,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:56:29,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:56:29,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:56:29,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:56:29,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:56:29,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:56:29,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:56:29,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:56:29,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:56:29,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:56:29,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:56:29,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:56:29,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:56:29,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:56:29,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:56:29,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:56:29,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:56:29,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:56:29,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:56:29,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:56:29,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:56:29,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:56:29,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:56:29,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:56:29,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:56:29,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:56:29,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:56:29,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:56:29,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:56:29,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:56:29,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:56:29,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:56:29,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:56:29,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:56:29,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:56:29,596 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 14:56:29,612 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:56:29,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:56:29,614 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:56:29,614 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:56:29,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:56:29,615 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:56:29,615 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:56:29,615 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:56:29,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:56:29,616 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 14:56:29,616 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 14:56:29,616 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:56:29,617 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:56:29,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:56:29,618 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:56:29,618 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:56:29,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:56:29,618 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:56:29,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:56:29,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:56:29,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:56:29,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:56:29,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:56:29,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:56:29,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:56:29,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:56:29,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:56:29,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:56:29,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:56:29,623 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:56:29,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:56:29,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:56:29,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:56:29,624 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:56:29,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:56:29,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:56:29,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:56:29,691 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:56:29,691 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:56:29,692 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl [2019-01-31 14:56:29,692 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl' [2019-01-31 14:56:29,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:56:29,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:56:29,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:56:29,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:56:29,789 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:56:29,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,836 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:56:29,836 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:56:29,836 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:56:29,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:56:29,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:56:29,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:56:29,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:56:29,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/1) ... [2019-01-31 14:56:29,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:56:29,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:56:29,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:56:29,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:56:29,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:56:30,033 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-01-31 14:56:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-01-31 14:56:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-01-31 14:56:30,035 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-01-31 14:56:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-01-31 14:56:30,035 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-01-31 14:56:30,035 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-01-31 14:56:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-01-31 14:56:30,036 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-01-31 14:56:30,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-01-31 14:56:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-01-31 14:56:30,036 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-01-31 14:56:30,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-01-31 14:56:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-01-31 14:56:30,040 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-01-31 14:56:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-01-31 14:56:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-01-31 14:56:30,040 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-01-31 14:56:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-01-31 14:56:30,042 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-01-31 14:56:30,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-01-31 14:56:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-01-31 14:56:30,043 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-01-31 14:56:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-01-31 14:56:30,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-01-31 14:56:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-01-31 14:56:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-01-31 14:56:30,044 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-01-31 14:56:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-01-31 14:56:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-01-31 14:56:30,044 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-01-31 14:56:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-01-31 14:56:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-01-31 14:56:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-01-31 14:56:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-01-31 14:56:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-01-31 14:56:30,047 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-01-31 14:56:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-01-31 14:56:30,048 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-01-31 14:56:30,048 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-01-31 14:56:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-01-31 14:56:30,048 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-01-31 14:56:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-01-31 14:56:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-01-31 14:56:30,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-01-31 14:56:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-01-31 14:56:30,051 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-01-31 14:56:30,051 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-01-31 14:56:30,051 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-01-31 14:56:30,051 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-01-31 14:56:30,051 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-01-31 14:56:30,052 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-01-31 14:56:30,052 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-01-31 14:56:30,052 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-01-31 14:56:30,052 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-01-31 14:56:30,052 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-01-31 14:56:30,052 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-01-31 14:56:30,053 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-01-31 14:56:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-01-31 14:56:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-01-31 14:56:30,488 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:30,577 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:30,652 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:30,689 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,408 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,433 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,446 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,453 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,460 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,489 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:31,513 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:56:32,735 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:56:32,736 INFO L286 CfgBuilder]: Removed 206 assue(true) statements. [2019-01-31 14:56:32,737 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:56:32 BoogieIcfgContainer [2019-01-31 14:56:32,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:56:32,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:56:32,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:56:32,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:56:32,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:56:29" (1/2) ... [2019-01-31 14:56:32,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d487706 and model type GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:56:32, skipping insertion in model container [2019-01-31 14:56:32,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:56:32" (2/2) ... [2019-01-31 14:56:32,746 INFO L112 eAbstractionObserver]: Analyzing ICFG GuiTestExampleUnsafe.bpl [2019-01-31 14:56:32,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:56:32,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-31 14:56:32,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-31 14:56:32,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:56:32,837 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:56:32,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:56:32,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:56:32,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:56:32,838 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:56:32,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:56:32,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:56:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-01-31 14:56:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:56:32,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:32,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:56:32,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash 10434, now seen corresponding path program 1 times [2019-01-31 14:56:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:32,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:33,119 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-01-31 14:56:33,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume !($r110 != $null); {308#false} is VALID [2019-01-31 14:56:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:33,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:33,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:56:33,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:33,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:56:33,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:33,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:56:33,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:56:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:56:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:56:33,191 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-01-31 14:56:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:34,194 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-01-31 14:56:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:56:34,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:56:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:56:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-01-31 14:56:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:56:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-01-31 14:56:34,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2019-01-31 14:56:34,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:34,639 INFO L225 Difference]: With dead ends: 304 [2019-01-31 14:56:34,640 INFO L226 Difference]: Without dead ends: 252 [2019-01-31 14:56:34,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-01-31 14:56:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-31 14:56:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-31 14:56:34,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:34,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2019-01-31 14:56:34,752 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-01-31 14:56:34,752 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-01-31 14:56:34,753 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:34,776 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:56:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:56:34,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:34,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:34,780 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-01-31 14:56:34,781 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-01-31 14:56:34,781 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:34,799 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:56:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:56:34,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:34,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:34,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:34,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-31 14:56:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2019-01-31 14:56:34,819 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 2 [2019-01-31 14:56:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:34,819 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2019-01-31 14:56:34,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:56:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:56:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:56:34,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:34,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:56:34,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash 168844, now seen corresponding path program 1 times [2019-01-31 14:56:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:34,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:34,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:34,883 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-01-31 14:56:34,883 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-01-31 14:56:34,884 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-01-31 14:56:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:34,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:34,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:34,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:34,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:34,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:34,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:34,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:34,894 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 4 states. [2019-01-31 14:56:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:35,713 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:56:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:35,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-01-31 14:56:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-01-31 14:56:35,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2019-01-31 14:56:36,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:36,008 INFO L225 Difference]: With dead ends: 252 [2019-01-31 14:56:36,009 INFO L226 Difference]: Without dead ends: 248 [2019-01-31 14:56:36,010 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-01-31 14:56:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-31 14:56:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-01-31 14:56:36,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:36,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 248 states. [2019-01-31 14:56:36,068 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-01-31 14:56:36,069 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-01-31 14:56:36,071 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:36,082 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:56:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:56:36,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:36,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:36,086 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-01-31 14:56:36,086 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-01-31 14:56:36,086 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:36,099 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:56:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:56:36,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:36,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:36,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:36,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-31 14:56:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 254 transitions. [2019-01-31 14:56:36,109 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 254 transitions. Word has length 3 [2019-01-31 14:56:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:36,109 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 254 transitions. [2019-01-31 14:56:36,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:56:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:56:36,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:36,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:56:36,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash 181753, now seen corresponding path program 1 times [2019-01-31 14:56:36,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:36,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:36,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:36,154 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-01-31 14:56:36,157 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-01-31 14:56:36,157 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-01-31 14:56:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:36,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:36,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:36,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:36,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:36,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:36,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:36,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:36,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:36,166 INFO L87 Difference]: Start difference. First operand 248 states and 254 transitions. Second operand 4 states. [2019-01-31 14:56:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:36,715 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:56:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:36,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-01-31 14:56:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-01-31 14:56:36,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 254 transitions. [2019-01-31 14:56:37,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:37,190 INFO L225 Difference]: With dead ends: 248 [2019-01-31 14:56:37,190 INFO L226 Difference]: Without dead ends: 244 [2019-01-31 14:56:37,193 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-01-31 14:56:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-31 14:56:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-01-31 14:56:37,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:37,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 244 states. [2019-01-31 14:56:37,240 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-01-31 14:56:37,240 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-01-31 14:56:37,241 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:37,249 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:56:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:56:37,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:37,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:37,250 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-01-31 14:56:37,250 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-01-31 14:56:37,250 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:37,259 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:56:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:56:37,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:37,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:37,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:37,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-01-31 14:56:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 251 transitions. [2019-01-31 14:56:37,269 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 251 transitions. Word has length 3 [2019-01-31 14:56:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:37,269 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 251 transitions. [2019-01-31 14:56:37,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:56:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:56:37,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:37,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:56:37,272 INFO L423 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash 323784, now seen corresponding path program 1 times [2019-01-31 14:56:37,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:37,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:37,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:37,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:37,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:37,357 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-01-31 14:56:37,357 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-01-31 14:56:37,359 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-01-31 14:56:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:37,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:37,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:37,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:37,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:37,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:37,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:37,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:37,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:37,363 INFO L87 Difference]: Start difference. First operand 244 states and 251 transitions. Second operand 4 states. [2019-01-31 14:56:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:37,908 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:56:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:37,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-01-31 14:56:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-01-31 14:56:37,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 251 transitions. [2019-01-31 14:56:38,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:38,182 INFO L225 Difference]: With dead ends: 244 [2019-01-31 14:56:38,182 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 14:56:38,183 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-01-31 14:56:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 14:56:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-31 14:56:38,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:38,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 243 states. [2019-01-31 14:56:38,420 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-01-31 14:56:38,420 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-01-31 14:56:38,420 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:38,428 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:56:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:56:38,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:38,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:38,430 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-01-31 14:56:38,430 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-01-31 14:56:38,430 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:38,439 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:56:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:56:38,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:38,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:38,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:38,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-31 14:56:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 250 transitions. [2019-01-31 14:56:38,448 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 250 transitions. Word has length 3 [2019-01-31 14:56:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:38,449 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 250 transitions. [2019-01-31 14:56:38,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:56:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:56:38,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:38,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:56:38,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash 161893, now seen corresponding path program 1 times [2019-01-31 14:56:38,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:38,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:38,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:38,579 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-01-31 14:56:38,580 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-01-31 14:56:38,581 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-01-31 14:56:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:38,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:38,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:38,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:38,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:38,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:38,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:38,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:38,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:38,588 INFO L87 Difference]: Start difference. First operand 243 states and 250 transitions. Second operand 4 states. [2019-01-31 14:56:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:39,672 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:56:39,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:39,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-01-31 14:56:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-01-31 14:56:39,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2019-01-31 14:56:39,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:39,909 INFO L225 Difference]: With dead ends: 243 [2019-01-31 14:56:39,909 INFO L226 Difference]: Without dead ends: 239 [2019-01-31 14:56:39,909 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-01-31 14:56:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-31 14:56:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-01-31 14:56:39,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:39,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2019-01-31 14:56:39,947 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-01-31 14:56:39,947 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-01-31 14:56:39,947 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:39,955 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:56:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:56:39,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:39,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:39,957 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-01-31 14:56:39,957 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-01-31 14:56:39,957 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:39,966 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:56:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:56:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:39,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:39,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:39,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-01-31 14:56:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 247 transitions. [2019-01-31 14:56:39,975 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 247 transitions. Word has length 3 [2019-01-31 14:56:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:39,975 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 247 transitions. [2019-01-31 14:56:39,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:56:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:56:39,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:39,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:56:39,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash 29824, now seen corresponding path program 1 times [2019-01-31 14:56:39,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:39,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:40,044 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-01-31 14:56:40,044 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-01-31 14:56:40,045 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-01-31 14:56:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:40,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:40,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:40,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:40,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:40,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:40,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:40,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:40,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:40,058 INFO L87 Difference]: Start difference. First operand 239 states and 247 transitions. Second operand 4 states. [2019-01-31 14:56:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:40,565 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:56:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:40,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:56:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-01-31 14:56:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-01-31 14:56:40,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2019-01-31 14:56:40,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:40,845 INFO L225 Difference]: With dead ends: 239 [2019-01-31 14:56:40,845 INFO L226 Difference]: Without dead ends: 235 [2019-01-31 14:56:40,846 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-01-31 14:56:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-31 14:56:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-01-31 14:56:40,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:40,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 235 states. [2019-01-31 14:56:40,861 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-01-31 14:56:40,861 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-01-31 14:56:40,861 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:40,868 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:56:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:56:40,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:40,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:40,869 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-01-31 14:56:40,870 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-01-31 14:56:40,870 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:40,876 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:56:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:56:40,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:40,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:40,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:40,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-31 14:56:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2019-01-31 14:56:40,882 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 3 [2019-01-31 14:56:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:40,882 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2019-01-31 14:56:40,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:56:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:56:40,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:40,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:56:40,885 INFO L423 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 6127075, now seen corresponding path program 1 times [2019-01-31 14:56:40,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:40,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:40,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:40,947 INFO L273 TraceCheckUtils]: 0: Hoare triple {9549#true} assume __this != $null; {9549#true} is VALID [2019-01-31 14:56:40,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {9549#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {9549#true} is VALID [2019-01-31 14:56:40,953 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-01-31 14:56:40,953 INFO L273 TraceCheckUtils]: 3: Hoare triple {9551#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {9550#false} is VALID [2019-01-31 14:56:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:40,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:40,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:56:40,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:40,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:56:40,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:40,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:56:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:56:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:56:40,962 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 3 states. [2019-01-31 14:56:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:41,784 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:56:41,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:56:41,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:56:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:56:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-01-31 14:56:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:56:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-01-31 14:56:41,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 244 transitions. [2019-01-31 14:56:42,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:42,387 INFO L225 Difference]: With dead ends: 235 [2019-01-31 14:56:42,387 INFO L226 Difference]: Without dead ends: 234 [2019-01-31 14:56:42,388 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-01-31 14:56:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-31 14:56:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-01-31 14:56:42,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:42,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 234 states. [2019-01-31 14:56:42,404 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-01-31 14:56:42,404 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-01-31 14:56:42,405 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:42,411 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-01-31 14:56:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-01-31 14:56:42,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:42,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:42,412 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-01-31 14:56:42,412 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-01-31 14:56:42,412 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:42,419 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-01-31 14:56:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-01-31 14:56:42,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:42,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:42,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:42,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-31 14:56:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2019-01-31 14:56:42,425 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 4 [2019-01-31 14:56:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:42,426 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2019-01-31 14:56:42,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:56:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-01-31 14:56:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:56:42,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:42,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:56:42,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1755747, now seen corresponding path program 1 times [2019-01-31 14:56:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:42,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:42,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:42,703 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-01-31 14:56:42,716 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-01-31 14:56:42,734 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-01-31 14:56:42,743 INFO L273 TraceCheckUtils]: 3: Hoare triple {11026#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {11024#false} is VALID [2019-01-31 14:56:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:56:42,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:42,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:56:42,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:42,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:56:42,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:42,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:56:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:56:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:56:42,799 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand 4 states. [2019-01-31 14:56:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:43,966 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-01-31 14:56:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:56:43,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:56:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-01-31 14:56:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:56:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-01-31 14:56:43,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2019-01-31 14:56:44,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:44,187 INFO L225 Difference]: With dead ends: 234 [2019-01-31 14:56:44,187 INFO L226 Difference]: Without dead ends: 213 [2019-01-31 14:56:44,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:56:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-31 14:56:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-31 14:56:44,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:44,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 213 states. [2019-01-31 14:56:44,244 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-01-31 14:56:44,244 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-01-31 14:56:44,244 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:44,249 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-01-31 14:56:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:56:44,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:44,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:44,250 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-01-31 14:56:44,250 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-01-31 14:56:44,250 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:44,255 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-01-31 14:56:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:56:44,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:44,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:44,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:44,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-31 14:56:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2019-01-31 14:56:44,260 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 4 [2019-01-31 14:56:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:44,260 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2019-01-31 14:56:44,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:56:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:56:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:56:44,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:44,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:56:44,263 INFO L423 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash 54428221, now seen corresponding path program 1 times [2019-01-31 14:56:44,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:44,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:56:44,545 INFO L273 TraceCheckUtils]: 0: Hoare triple {12392#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-01-31 14:56:44,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {12394#(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; {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-01-31 14:56:44,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {12395#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-01-31 14:56:44,547 INFO L273 TraceCheckUtils]: 3: Hoare triple {12395#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume r012 != $null;void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this := r012; {12396#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} is VALID [2019-01-31 14:56:44,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {12396#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} assume !(void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this != $null); {12393#false} is VALID [2019-01-31 14:56:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:56:44,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:56:44,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 14:56:44,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:56:44,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 14:56:44,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:56:44,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:56:44,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:44,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:56:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:56:44,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:56:44,560 INFO L87 Difference]: Start difference. First operand 213 states and 222 transitions. Second operand 5 states. [2019-01-31 14:56:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:56:46,020 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-01-31 14:56:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:56:46,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 14:56:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:56:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:56:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2019-01-31 14:56:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:56:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2019-01-31 14:56:46,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 222 transitions. [2019-01-31 14:56:46,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:56:46,213 INFO L225 Difference]: With dead ends: 213 [2019-01-31 14:56:46,213 INFO L226 Difference]: Without dead ends: 212 [2019-01-31 14:56:46,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:56:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-31 14:56:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-01-31 14:56:46,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:56:46,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 212 states. [2019-01-31 14:56:46,232 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-01-31 14:56:46,232 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-01-31 14:56:46,233 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:46,237 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-01-31 14:56:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-01-31 14:56:46,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:46,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:46,238 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-01-31 14:56:46,238 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-01-31 14:56:46,239 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:56:46,243 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-01-31 14:56:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-01-31 14:56:46,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:56:46,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:56:46,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:56:46,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:56:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-31 14:56:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2019-01-31 14:56:46,248 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 5 [2019-01-31 14:56:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:56:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2019-01-31 14:56:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:56:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-01-31 14:56:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:56:46,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:56:46,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:56:46,250 INFO L423 AbstractCegarLoop]: === Iteration 10 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, 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$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:56:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:56:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 179442176, now seen corresponding path program 1 times [2019-01-31 14:56:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:56:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:46,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:56:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:56:46,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:56:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:56:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:56:46,269 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$actionPerformed$4553ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$actionPerformed$4886ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809ENTRY has no Hoare annotation [2019-01-31 14:56:46,281 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804ENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $EFG_ProcedureENTRY has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806FINAL has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,282 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808FINAL has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807FINAL has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-01-31 14:56:46,283 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246FINAL has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809FINAL has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,284 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885FINAL has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:56:46,285 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802FINAL has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552FINAL has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887FINAL has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-01-31 14:56:46,286 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:56:46,287 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888FINAL has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L420-1 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2019-01-31 14:56:46,288 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804FINAL has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:56:46,289 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-01-31 14:56:46,290 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:56:46,291 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:56:46,292 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,293 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,294 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,295 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,296 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,297 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:56:46,298 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: Event2_Block67 has no Hoare annotation [2019-01-31 14:56:46,299 WARN L170 areAnnotationChecker]: Event0_Block65 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: Event1_Block66 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:56:46,300 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:56:46,301 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:56:46,302 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:56:46,303 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-01-31 14:56:46,304 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805FINAL has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:56:46,305 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-01-31 14:56:46,306 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L753-1 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-01-31 14:56:46,307 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:56:46,308 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:56:46,309 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803FINAL has no Hoare annotation [2019-01-31 14:56:46,309 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-01-31 14:56:46,313 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:56:46 BoogieIcfgContainer [2019-01-31 14:56:46,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:56:46,315 INFO L168 Benchmark]: Toolchain (without parser) took 16528.15 ms. Allocated memory was 136.8 MB in the beginning and 382.2 MB in the end (delta: 245.4 MB). Free memory was 101.0 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:56:46,317 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 104.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:56:46,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.46 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 94.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:56:46,318 INFO L168 Benchmark]: Boogie Preprocessor took 56.65 ms. Allocated memory is still 136.8 MB. Free memory was 94.7 MB in the beginning and 92.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 14:56:46,319 INFO L168 Benchmark]: RCFGBuilder took 2785.29 ms. Allocated memory was 136.8 MB in the beginning and 179.8 MB in the end (delta: 43.0 MB). Free memory was 92.3 MB in the beginning and 76.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:56:46,320 INFO L168 Benchmark]: TraceAbstraction took 13574.93 ms. Allocated memory was 179.8 MB in the beginning and 382.2 MB in the end (delta: 202.4 MB). Free memory was 76.5 MB in the beginning and 156.1 MB in the end (delta: -79.6 MB). Peak memory consumption was 122.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:56:46,324 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.20 ms. Allocated memory is still 136.8 MB. Free memory is still 104.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.46 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 94.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.65 ms. Allocated memory is still 136.8 MB. Free memory was 94.7 MB in the beginning and 92.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2785.29 ms. Allocated memory was 136.8 MB in the beginning and 179.8 MB in the end (delta: 43.0 MB). Free memory was 92.3 MB in the beginning and 76.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13574.93 ms. Allocated memory was 179.8 MB in the beginning and 382.2 MB in the end (delta: 202.4 MB). Free memory was 76.5 MB in the beginning and 156.1 MB in the end (delta: -79.6 MB). Peak memory consumption was 122.8 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, 13.4s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2210 SDtfs, 400 SDslu, 3757 SDs, 0 SdLazy, 41 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s 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.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...