java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:30:58,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:30:58,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:30:58,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:30:58,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:30:58,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:30:58,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:30:58,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:30:58,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:30:58,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:30:58,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:30:58,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:30:58,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:30:58,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:30:58,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:30:58,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:30:58,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:30:58,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:30:58,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:30:58,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:30:58,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:30:58,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:30:58,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:30:58,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:30:58,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:30:58,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:30:58,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:30:58,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:30:58,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:30:58,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:30:58,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:30:58,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:30:58,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:30:58,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:30:58,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:30:58,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:30:58,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:30:58,439 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:30:58,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:30:58,440 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:30:58,440 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:30:58,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:30:58,440 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:30:58,441 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:30:58,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:30:58,441 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:30:58,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:30:58,442 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:30:58,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:30:58,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:30:58,442 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:30:58,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:30:58,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:30:58,443 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:30:58,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:30:58,444 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:30:58,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:30:58,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:30:58,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:30:58,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:30:58,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:30:58,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:30:58,445 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:30:58,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:30:58,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:30:58,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:30:58,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:30:58,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:30:58,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:30:58,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:30:58,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:30:58,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:30:58,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:30:58,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:30:58,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:30:58,448 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:30:58,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:30:58,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:30:58,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:30:58,527 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:30:58,527 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:30:58,528 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:30:58,528 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl' [2019-01-31 14:30:58,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:30:58,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:30:58,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:30:58,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:30:58,647 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:30:58" (1/1) ... [2019-01-31 14:30:58,667 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:30:58" (1/1) ... [2019-01-31 14:30:58,685 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:30:58,686 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:30:58,686 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:30:58,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:30:58,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:30:58,804 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:30:58" (1/1) ... [2019-01-31 14:30:58,804 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:30:58" (1/1) ... [2019-01-31 14:30:58,827 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:30:58" (1/1) ... [2019-01-31 14:30:58,828 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:30:58" (1/1) ... [2019-01-31 14:30:58,856 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:30:58" (1/1) ... [2019-01-31 14:30:58,866 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:30:58" (1/1) ... [2019-01-31 14:30:58,874 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:30:58" (1/1) ... [2019-01-31 14:30:58,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:30:58,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:30:58,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:30:58,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (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:30:58,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-01-31 14:30:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-01-31 14:30:58,961 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-01-31 14:30:58,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-01-31 14:30:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-01-31 14:30:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-01-31 14:30:58,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-01-31 14:30:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-01-31 14:30:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-01-31 14:30:58,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-01-31 14:30:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-01-31 14:30:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-01-31 14:30:58,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-01-31 14:30:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-01-31 14:30:58,969 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-01-31 14:30:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-01-31 14:30:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-01-31 14:30:58,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-01-31 14:30:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-01-31 14:30:58,970 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-01-31 14:30:58,970 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-01-31 14:30:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-01-31 14:30:58,970 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-01-31 14:30:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-01-31 14:30:58,971 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:30:58,973 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-01-31 14:30:58,973 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-01-31 14:30:58,973 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:30:58,973 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-01-31 14:30:58,973 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-01-31 14:30:58,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-01-31 14:30:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-01-31 14:30:58,974 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-01-31 14:30:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-01-31 14:30:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-01-31 14:30:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-01-31 14:30:58,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-01-31 14:30:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-01-31 14:30:58,975 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-01-31 14:30:58,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-01-31 14:30:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-01-31 14:30:58,978 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-01-31 14:30:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-01-31 14:30:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-01-31 14:30:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-01-31 14:30:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-01-31 14:30:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-01-31 14:30:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-01-31 14:30:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-01-31 14:30:58,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-01-31 14:30:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-01-31 14:30:58,979 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-01-31 14:30:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-01-31 14:30:58,980 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-01-31 14:30:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-01-31 14:30:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-01-31 14:30:58,980 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-01-31 14:30:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-01-31 14:30:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-01-31 14:30:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-01-31 14:30:58,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-01-31 14:30:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-01-31 14:30:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-01-31 14:30:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-01-31 14:30:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-01-31 14:30:59,346 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:30:59,420 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:30:59,489 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:30:59,539 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,137 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,161 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,174 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,178 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,271 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,290 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:00,376 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-31 14:31:01,621 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:31:01,622 INFO L286 CfgBuilder]: Removed 206 assue(true) statements. [2019-01-31 14:31:01,623 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:01 BoogieIcfgContainer [2019-01-31 14:31:01,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:01,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:01,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:01,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/2) ... [2019-01-31 14:31:01,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4983e33d and model type GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:01, skipping insertion in model container [2019-01-31 14:31:01,629 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:31:01" (2/2) ... [2019-01-31 14:31:01,631 INFO L112 eAbstractionObserver]: Analyzing ICFG GuiTestExampleUnsafe.bpl [2019-01-31 14:31:01,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:01,650 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-31 14:31:01,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-31 14:31:01,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:01,712 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:01,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:01,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:01,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:01,713 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:01,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:01,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-01-31 14:31:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:31:01,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:01,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:31:01,759 INFO L423 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 10434, now seen corresponding path program 1 times [2019-01-31 14:31:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:01,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:01,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:02,006 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:31:02,023 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:31:02,026 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:31:02,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:31:02,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:02,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:31:02,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:02,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:02,070 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:31:02,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:02,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:02,083 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-01-31 14:31:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,097 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-01-31 14:31:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:03,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:31:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-01-31 14:31:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-01-31 14:31:03,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2019-01-31 14:31:03,543 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:31:03,580 INFO L225 Difference]: With dead ends: 304 [2019-01-31 14:31:03,580 INFO L226 Difference]: Without dead ends: 252 [2019-01-31 14:31:03,585 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:31:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-31 14:31:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-31 14:31:03,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:03,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2019-01-31 14:31:03,691 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-01-31 14:31:03,692 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-01-31 14:31:03,692 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:03,715 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:31:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:31:03,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,719 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-01-31 14:31:03,719 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-01-31 14:31:03,719 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:03,737 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:31:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:31:03,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:03,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:03,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:03,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-31 14:31:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2019-01-31 14:31:03,757 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 2 [2019-01-31 14:31:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:03,757 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2019-01-31 14:31:03,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-01-31 14:31:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:03,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:03,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:03,761 INFO L423 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 168844, now seen corresponding path program 1 times [2019-01-31 14:31:03,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:03,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:03,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:03,846 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:31:03,847 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:31:03,864 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:31:03,864 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:31:03,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:03,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:03,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:03,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:03,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:03,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:03,884 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:31:03,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:03,885 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 4 states. [2019-01-31 14:31:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:04,824 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-01-31 14:31:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:04,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-01-31 14:31:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-01-31 14:31:04,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2019-01-31 14:31:05,121 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:31:05,128 INFO L225 Difference]: With dead ends: 252 [2019-01-31 14:31:05,129 INFO L226 Difference]: Without dead ends: 248 [2019-01-31 14:31:05,130 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:31:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-31 14:31:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-01-31 14:31:05,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:05,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 248 states. [2019-01-31 14:31:05,182 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-01-31 14:31:05,182 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-01-31 14:31:05,182 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:05,192 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:31:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:31:05,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:05,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:05,195 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-01-31 14:31:05,195 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-01-31 14:31:05,195 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:05,206 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:31:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:31:05,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:05,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:05,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:05,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-31 14:31:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 254 transitions. [2019-01-31 14:31:05,216 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 254 transitions. Word has length 3 [2019-01-31 14:31:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:05,216 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 254 transitions. [2019-01-31 14:31:05,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-01-31 14:31:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:05,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:05,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:05,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash 181753, now seen corresponding path program 1 times [2019-01-31 14:31:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:05,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:05,258 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:31:05,259 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:31:05,260 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:31:05,260 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:31:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:05,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:05,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:05,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:05,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:05,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:05,266 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:31:05,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:05,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:05,267 INFO L87 Difference]: Start difference. First operand 248 states and 254 transitions. Second operand 4 states. [2019-01-31 14:31:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:05,810 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-01-31 14:31:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:05,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-01-31 14:31:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-01-31 14:31:05,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 254 transitions. [2019-01-31 14:31:06,300 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:31:06,305 INFO L225 Difference]: With dead ends: 248 [2019-01-31 14:31:06,306 INFO L226 Difference]: Without dead ends: 244 [2019-01-31 14:31:06,306 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:31:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-31 14:31:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-01-31 14:31:06,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:06,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 244 states. [2019-01-31 14:31:06,363 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-01-31 14:31:06,364 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-01-31 14:31:06,364 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:06,372 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:31:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:31:06,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:06,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:06,373 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-01-31 14:31:06,373 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-01-31 14:31:06,373 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:06,382 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:31:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:31:06,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:06,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:06,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:06,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-01-31 14:31:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 251 transitions. [2019-01-31 14:31:06,393 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 251 transitions. Word has length 3 [2019-01-31 14:31:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:06,393 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 251 transitions. [2019-01-31 14:31:06,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-01-31 14:31:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:06,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:06,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:06,396 INFO L423 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 323784, now seen corresponding path program 1 times [2019-01-31 14:31:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:06,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:06,461 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:31:06,461 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:31:06,464 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:31:06,464 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:31:06,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:06,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:06,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:06,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:06,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:06,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:06,467 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:31:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:06,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:06,467 INFO L87 Difference]: Start difference. First operand 244 states and 251 transitions. Second operand 4 states. [2019-01-31 14:31:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,027 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-01-31 14:31:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:07,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-01-31 14:31:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-01-31 14:31:07,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 251 transitions. [2019-01-31 14:31:07,245 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:31:07,251 INFO L225 Difference]: With dead ends: 244 [2019-01-31 14:31:07,251 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 14:31:07,252 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:31:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 14:31:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-31 14:31:07,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:07,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 243 states. [2019-01-31 14:31:07,477 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-01-31 14:31:07,477 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-01-31 14:31:07,477 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:07,487 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:31:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:31:07,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,488 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-01-31 14:31:07,488 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-01-31 14:31:07,488 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:07,497 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:31:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:31:07,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:07,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-31 14:31:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 250 transitions. [2019-01-31 14:31:07,507 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 250 transitions. Word has length 3 [2019-01-31 14:31:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 250 transitions. [2019-01-31 14:31:07,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-01-31 14:31:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:07,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:07,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:07,510 INFO L423 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 161893, now seen corresponding path program 1 times [2019-01-31 14:31:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:07,644 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:31:07,645 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:31:07,645 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:31:07,645 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:31:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:07,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:07,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:07,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:07,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:07,648 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:31:07,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:07,649 INFO L87 Difference]: Start difference. First operand 243 states and 250 transitions. Second operand 4 states. [2019-01-31 14:31:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,834 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-01-31 14:31:08,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:08,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-01-31 14:31:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-01-31 14:31:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2019-01-31 14:31:09,097 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:31:09,103 INFO L225 Difference]: With dead ends: 243 [2019-01-31 14:31:09,103 INFO L226 Difference]: Without dead ends: 239 [2019-01-31 14:31:09,104 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:31:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-31 14:31:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-01-31 14:31:09,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:09,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2019-01-31 14:31:09,163 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-01-31 14:31:09,163 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-01-31 14:31:09,164 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:09,171 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:31:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:31:09,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:09,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:09,172 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-01-31 14:31:09,173 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-01-31 14:31:09,173 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:09,181 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:31:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:31:09,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:09,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:09,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:09,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-01-31 14:31:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 247 transitions. [2019-01-31 14:31:09,189 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 247 transitions. Word has length 3 [2019-01-31 14:31:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:09,189 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 247 transitions. [2019-01-31 14:31:09,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-01-31 14:31:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:09,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:09,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:09,192 INFO L423 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash 29824, now seen corresponding path program 1 times [2019-01-31 14:31:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:09,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:09,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,462 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:31:09,476 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:31:09,488 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:31:09,489 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:31:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:09,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:09,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:09,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:09,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:09,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:09,528 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:31:09,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:09,530 INFO L87 Difference]: Start difference. First operand 239 states and 247 transitions. Second operand 4 states. [2019-01-31 14:31:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,332 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-01-31 14:31:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:10,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-01-31 14:31:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-01-31 14:31:10,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2019-01-31 14:31:10,559 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:31:10,564 INFO L225 Difference]: With dead ends: 239 [2019-01-31 14:31:10,564 INFO L226 Difference]: Without dead ends: 235 [2019-01-31 14:31:10,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-31 14:31:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-01-31 14:31:10,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:10,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 235 states. [2019-01-31 14:31:10,596 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-01-31 14:31:10,596 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-01-31 14:31:10,596 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:10,603 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:31:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:31:10,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,604 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-01-31 14:31:10,605 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-01-31 14:31:10,605 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:10,612 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:31:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:31:10,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:10,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-31 14:31:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2019-01-31 14:31:10,619 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 3 [2019-01-31 14:31:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:10,619 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2019-01-31 14:31:10,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-01-31 14:31:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:10,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:10,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:10,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1755747, now seen corresponding path program 1 times [2019-01-31 14:31:10,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:10,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:10,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:10,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:10,909 INFO L273 TraceCheckUtils]: 0: Hoare triple {9549#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {9551#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-01-31 14:31:10,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {9551#(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; {9551#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-01-31 14:31:10,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {9551#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {9552#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-01-31 14:31:10,948 INFO L273 TraceCheckUtils]: 3: Hoare triple {9552#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {9550#false} is VALID [2019-01-31 14:31:10,949 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:31:10,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:10,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:10,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:10,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:10,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:10,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:11,005 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:31:11,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:11,007 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 4 states. [2019-01-31 14:31:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,914 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-01-31 14:31:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:11,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2019-01-31 14:31:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2019-01-31 14:31:11,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2019-01-31 14:31:12,462 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:31:12,467 INFO L225 Difference]: With dead ends: 235 [2019-01-31 14:31:12,467 INFO L226 Difference]: Without dead ends: 214 [2019-01-31 14:31:12,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-31 14:31:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-01-31 14:31:12,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:12,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 214 states. [2019-01-31 14:31:12,489 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 214 states. [2019-01-31 14:31:12,489 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 214 states. [2019-01-31 14:31:12,490 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:12,494 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2019-01-31 14:31:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2019-01-31 14:31:12,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:12,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:12,496 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 214 states. [2019-01-31 14:31:12,496 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 214 states. [2019-01-31 14:31:12,496 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:12,501 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2019-01-31 14:31:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2019-01-31 14:31:12,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:12,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:12,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:12,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-31 14:31:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2019-01-31 14:31:12,507 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 4 [2019-01-31 14:31:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2019-01-31 14:31:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2019-01-31 14:31:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:12,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:12,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:12,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:12,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 6127075, now seen corresponding path program 1 times [2019-01-31 14:31:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:12,539 INFO L273 TraceCheckUtils]: 0: Hoare triple {10924#true} assume __this != $null; {10924#true} is VALID [2019-01-31 14:31:12,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {10924#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {10924#true} is VALID [2019-01-31 14:31:12,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {10924#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {10926#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-01-31 14:31:12,542 INFO L273 TraceCheckUtils]: 3: Hoare triple {10926#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {10925#false} is VALID [2019-01-31 14:31:12,542 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:31:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:12,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:12,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:31:12,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:12,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:12,548 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:31:12,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:12,548 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 3 states. [2019-01-31 14:31:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,041 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2019-01-31 14:31:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:13,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:31:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2019-01-31 14:31:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2019-01-31 14:31:13,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 223 transitions. [2019-01-31 14:31:13,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:13,488 INFO L225 Difference]: With dead ends: 214 [2019-01-31 14:31:13,488 INFO L226 Difference]: Without dead ends: 213 [2019-01-31 14:31:13,489 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:31:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-31 14:31:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-31 14:31:13,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:13,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 213 states. [2019-01-31 14:31:13,568 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-01-31 14:31:13,568 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-01-31 14:31:13,568 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:13,573 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-01-31 14:31:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:31:13,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,575 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-01-31 14:31:13,575 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-01-31 14:31:13,575 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-01-31 14:31:13,580 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-01-31 14:31:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:31:13,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:13,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-31 14:31:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2019-01-31 14:31:13,586 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 4 [2019-01-31 14:31:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:13,586 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2019-01-31 14:31:13,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-01-31 14:31:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:13,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:13,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:31:13,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 14:31:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 33433511, now seen corresponding path program 1 times [2019-01-31 14:31:13,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:13,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:31:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-31 14:31:13,618 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$actionPerformed$4553ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$actionPerformed$4886ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246ENTRY has no Hoare annotation [2019-01-31 14:31:13,630 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804ENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: $EFG_ProcedureENTRY has no Hoare annotation [2019-01-31 14:31:13,631 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806FINAL has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,632 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808FINAL has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807FINAL has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-01-31 14:31:13,633 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:31:13,634 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246FINAL has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809FINAL has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-01-31 14:31:13,635 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885FINAL has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802FINAL has no Hoare annotation [2019-01-31 14:31:13,636 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552FINAL has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887FINAL has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-01-31 14:31:13,637 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-01-31 14:31:13,638 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888FINAL has no Hoare annotation [2019-01-31 14:31:13,639 WARN L170 areAnnotationChecker]: L420-1 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804FINAL has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:31:13,640 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-01-31 14:31:13,641 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2019-01-31 14:31:13,642 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,643 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,644 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:31:13,645 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,646 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,647 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:31:13,648 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-01-31 14:31:13,649 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:31:13,649 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,649 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,649 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:31:13,649 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:31:13,650 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-01-31 14:31:13,651 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:31:13,652 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,653 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,654 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:31:13,655 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,656 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2019-01-31 14:31:13,657 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:31:13,658 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: Event2_Block67 has no Hoare annotation [2019-01-31 14:31:13,659 WARN L170 areAnnotationChecker]: Event0_Block65 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: Event1_Block66 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:31:13,660 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:31:13,661 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:31:13,662 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:31:13,663 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:31:13,664 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-01-31 14:31:13,664 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:31:13,664 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:31:13,664 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:31:13,664 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:31:13,665 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:31:13,666 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-01-31 14:31:13,667 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805FINAL has no Hoare annotation [2019-01-31 14:31:13,668 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:31:13,669 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:31:13,670 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L753-1 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:31:13,671 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-01-31 14:31:13,672 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-01-31 14:31:13,673 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:31:13,673 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-01-31 14:31:13,673 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803FINAL has no Hoare annotation [2019-01-31 14:31:13,673 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:31:13,680 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:13 BoogieIcfgContainer [2019-01-31 14:31:13,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:13,681 INFO L168 Benchmark]: Toolchain (without parser) took 15055.96 ms. Allocated memory was 134.7 MB in the beginning and 312.0 MB in the end (delta: 177.2 MB). Free memory was 106.4 MB in the beginning and 85.0 MB in the end (delta: 21.4 MB). Peak memory consumption was 198.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:13,685 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:13,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.78 ms. Allocated memory is still 134.7 MB. Free memory was 106.2 MB in the beginning and 100.1 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:31:13,687 INFO L168 Benchmark]: Boogie Preprocessor took 100.71 ms. Allocated memory is still 134.7 MB. Free memory was 100.1 MB in the beginning and 97.7 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:31:13,688 INFO L168 Benchmark]: RCFGBuilder took 2737.35 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 97.7 MB in the beginning and 72.9 MB in the end (delta: 24.7 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:13,690 INFO L168 Benchmark]: TraceAbstraction took 12055.89 ms. Allocated memory was 169.9 MB in the beginning and 312.0 MB in the end (delta: 142.1 MB). Free memory was 72.9 MB in the beginning and 85.0 MB in the end (delta: -12.0 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:13,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 155.78 ms. Allocated memory is still 134.7 MB. Free memory was 106.2 MB in the beginning and 100.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.71 ms. Allocated memory is still 134.7 MB. Free memory was 100.1 MB in the beginning and 97.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2737.35 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 97.7 MB in the beginning and 72.9 MB in the end (delta: 24.7 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12055.89 ms. Allocated memory was 169.9 MB in the beginning and 312.0 MB in the end (delta: 142.1 MB). Free memory was 72.9 MB in the beginning and 85.0 MB in the end (delta: -12.0 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 481]: assertion can be violated assertion can be violated We found a FailurePath: [L462-L464] requires void$SimpleFrame2Cons$2$actionPerformed$4553$__this != $null; [L474] r098 := void$SimpleFrame2Cons$2$actionPerformed$4553$__this; [L476] r199 := void$SimpleFrame2Cons$2$actionPerformed$4553$param_0; [L478] $r2102 := SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711; [L390] r083 := $param_0; [L392] $r185 := javax.swing.JButton$SimpleFrame2Cons$event2227; [L394] __ret := $r185; [L481] assert $r3103 != $null; - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 304 locations, 87 error locations. UNSAFE Result, 11.9s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1983 SDtfs, 238 SDslu, 3242 SDs, 0 SdLazy, 26 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...