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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/real-life/GuiTestExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:15:10,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:15:10,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:15:10,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:15:10,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:15:10,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:15:10,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:15:10,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:15:10,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:15:10,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:15:10,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:15:10,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:15:10,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:15:10,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:15:10,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:15:10,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:15:10,509 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:15:10,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:15:10,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:15:10,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:15:10,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:15:10,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:15:10,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:15:10,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:15:10,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:15:10,530 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:15:10,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:15:10,531 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:15:10,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:15:10,533 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:15:10,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:15:10,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:15:10,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:15:10,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:15:10,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:15:10,537 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:15:10,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:15:10,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:15:10,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:15:10,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:15:10,586 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:15:10,592 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:15:10,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:15:10,594 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:15:10,595 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl [2019-05-15 10:15:10,595 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl' [2019-05-15 10:15:10,720 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:15:10,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:15:10,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:15:10,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:15:10,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,784 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:15:10,784 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:15:10,784 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:15:10,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:15:10,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:15:10,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:15:10,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:15:10,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:15:10,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:15:10,994 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-05-15 10:15:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-05-15 10:15:10,994 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-05-15 10:15:10,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-05-15 10:15:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-05-15 10:15:10,995 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-05-15 10:15:10,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-05-15 10:15:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-05-15 10:15:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-05-15 10:15:10,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-05-15 10:15:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-05-15 10:15:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-05-15 10:15:10,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-05-15 10:15:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-05-15 10:15:10,998 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-05-15 10:15:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-05-15 10:15:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-05-15 10:15:10,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-05-15 10:15:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-05-15 10:15:10,998 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-05-15 10:15:10,999 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-05-15 10:15:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-05-15 10:15:11,000 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-05-15 10:15:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-05-15 10:15:11,000 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-05-15 10:15:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-05-15 10:15:11,000 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-05-15 10:15:11,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-05-15 10:15:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-05-15 10:15:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-05-15 10:15:11,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-05-15 10:15:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-05-15 10:15:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-05-15 10:15:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-05-15 10:15:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-05-15 10:15:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-05-15 10:15:11,004 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-05-15 10:15:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-05-15 10:15:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-05-15 10:15:11,004 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-05-15 10:15:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-05-15 10:15:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-05-15 10:15:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-05-15 10:15:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-05-15 10:15:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-05-15 10:15:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-05-15 10:15:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-05-15 10:15:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-05-15 10:15:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-05-15 10:15:11,006 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-05-15 10:15:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-05-15 10:15:11,006 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-05-15 10:15:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-05-15 10:15:11,007 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-05-15 10:15:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-05-15 10:15:11,007 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-05-15 10:15:11,007 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-05-15 10:15:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-05-15 10:15:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-05-15 10:15:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-05-15 10:15:11,008 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-05-15 10:15:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-05-15 10:15:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-05-15 10:15:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-05-15 10:15:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-05-15 10:15:11,372 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:11,635 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:11,803 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:11,881 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,866 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,887 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,909 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,915 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,929 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:12,942 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:13,083 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:15:14,187 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:15:14,187 INFO L283 CfgBuilder]: Removed 44 assume(true) statements. [2019-05-15 10:15:14,188 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:14 BoogieIcfgContainer [2019-05-15 10:15:14,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:15:14,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:15:14,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:15:14,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:15:14,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/2) ... [2019-05-15 10:15:14,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6871a6a8 and model type GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:15:14, skipping insertion in model container [2019-05-15 10:15:14,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:14" (2/2) ... [2019-05-15 10:15:14,200 INFO L109 eAbstractionObserver]: Analyzing ICFG GuiTestExample.bpl [2019-05-15 10:15:14,207 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:15:14,214 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-05-15 10:15:14,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-05-15 10:15:14,251 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:15:14,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:15:14,252 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:15:14,252 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:15:14,252 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:15:14,252 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:15:14,252 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:15:14,253 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:15:14,253 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:15:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states. [2019-05-15 10:15:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:15:14,304 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:14,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:15:14,310 INFO L418 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash 261193, now seen corresponding path program 1 times [2019-05-15 10:15:14,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:14,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:14,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:14,595 INFO L273 TraceCheckUtils]: 0: Hoare triple {648#true} assume void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null; {653#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:14,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {653#(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; {657#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-05-15 10:15:14,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {657#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} assume !(r01 != $null); {649#false} is VALID [2019-05-15 10:15:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:14,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:14,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:15:14,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-05-15 10:15:14,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:14,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:14,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:14,699 INFO L87 Difference]: Start difference. First operand 645 states. Second operand 4 states. [2019-05-15 10:15:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:16,628 INFO L93 Difference]: Finished difference Result 640 states and 642 transitions. [2019-05-15 10:15:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:16,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-05-15 10:15:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2019-05-15 10:15:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2019-05-15 10:15:16,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 647 transitions. [2019-05-15 10:15:17,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:17,502 INFO L225 Difference]: With dead ends: 640 [2019-05-15 10:15:17,502 INFO L226 Difference]: Without dead ends: 558 [2019-05-15 10:15:17,504 INFO L628 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-05-15 10:15:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-05-15 10:15:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-05-15 10:15:17,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:17,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand 558 states. [2019-05-15 10:15:17,568 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand 558 states. [2019-05-15 10:15:17,568 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 558 states. [2019-05-15 10:15:17,568 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:17,661 INFO L93 Difference]: Finished difference Result 558 states and 564 transitions. [2019-05-15 10:15:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 564 transitions. [2019-05-15 10:15:17,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:17,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:17,675 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand 558 states. [2019-05-15 10:15:17,675 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 558 states. [2019-05-15 10:15:17,675 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:17,710 INFO L93 Difference]: Finished difference Result 558 states and 564 transitions. [2019-05-15 10:15:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 564 transitions. [2019-05-15 10:15:17,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:17,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:17,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:17,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-05-15 10:15:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 564 transitions. [2019-05-15 10:15:17,749 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 564 transitions. Word has length 3 [2019-05-15 10:15:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:17,751 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 564 transitions. [2019-05-15 10:15:17,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 564 transitions. [2019-05-15 10:15:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:15:17,752 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:17,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:15:17,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash 16224195, now seen corresponding path program 1 times [2019-05-15 10:15:17,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:17,762 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:17,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:17,804 INFO L273 TraceCheckUtils]: 0: Hoare triple {4078#true} r09 := $param_0; {4078#true} is VALID [2019-05-15 10:15:17,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {4078#true} $r110 := $fresh2; {4086#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} is VALID [2019-05-15 10:15:17,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {4086#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} assume $fresh2 != $null; {4090#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:15:17,813 INFO L273 TraceCheckUtils]: 3: Hoare triple {4090#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume !($r110 != $null); {4079#false} is VALID [2019-05-15 10:15:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:17,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:17,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:15:17,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:15:17,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:17,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:17,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:17,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:17,832 INFO L87 Difference]: Start difference. First operand 558 states and 564 transitions. Second operand 4 states. [2019-05-15 10:15:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:19,986 INFO L93 Difference]: Finished difference Result 557 states and 563 transitions. [2019-05-15 10:15:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:19,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:15:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2019-05-15 10:15:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2019-05-15 10:15:19,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 564 transitions. [2019-05-15 10:15:20,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:20,583 INFO L225 Difference]: With dead ends: 557 [2019-05-15 10:15:20,583 INFO L226 Difference]: Without dead ends: 557 [2019-05-15 10:15:20,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05-15 10:15:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-05-15 10:15:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-05-15 10:15:20,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:20,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand 557 states. [2019-05-15 10:15:20,607 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand 557 states. [2019-05-15 10:15:20,607 INFO L87 Difference]: Start difference. First operand 557 states. Second operand 557 states. [2019-05-15 10:15:20,607 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:20,635 INFO L93 Difference]: Finished difference Result 557 states and 563 transitions. [2019-05-15 10:15:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 563 transitions. [2019-05-15 10:15:20,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:20,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:20,637 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand 557 states. [2019-05-15 10:15:20,637 INFO L87 Difference]: Start difference. First operand 557 states. Second operand 557 states. [2019-05-15 10:15:20,637 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:20,664 INFO L93 Difference]: Finished difference Result 557 states and 563 transitions. [2019-05-15 10:15:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 563 transitions. [2019-05-15 10:15:20,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:20,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:20,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:20,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-05-15 10:15:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 563 transitions. [2019-05-15 10:15:20,691 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 563 transitions. Word has length 4 [2019-05-15 10:15:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:20,691 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 563 transitions. [2019-05-15 10:15:20,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 563 transitions. [2019-05-15 10:15:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:15:20,692 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:20,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:15:20,695 INFO L418 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 277734566, now seen corresponding path program 1 times [2019-05-15 10:15:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:20,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:20,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:20,812 INFO L273 TraceCheckUtils]: 0: Hoare triple {7423#true} assume void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this != $null; {7428#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} is VALID [2019-05-15 10:15:20,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {7428#(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; {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-05-15 10:15:20,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} r1121 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0; {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-05-15 10:15:20,814 INFO L273 TraceCheckUtils]: 3: Hoare triple {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763 := r1121; {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-05-15 10:15:20,820 INFO L273 TraceCheckUtils]: 4: Hoare triple {7432#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} assume !(r0120 != $null); {7424#false} is VALID [2019-05-15 10:15:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:20,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:20,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:15:20,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:20,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:20,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:20,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:20,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:20,834 INFO L87 Difference]: Start difference. First operand 557 states and 563 transitions. Second operand 4 states. [2019-05-15 10:15:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:22,122 INFO L93 Difference]: Finished difference Result 556 states and 562 transitions. [2019-05-15 10:15:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:22,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2019-05-15 10:15:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2019-05-15 10:15:22,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 563 transitions. [2019-05-15 10:15:22,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:22,793 INFO L225 Difference]: With dead ends: 556 [2019-05-15 10:15:22,793 INFO L226 Difference]: Without dead ends: 551 [2019-05-15 10:15:22,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05-15 10:15:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-05-15 10:15:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-05-15 10:15:22,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:22,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand 551 states. [2019-05-15 10:15:22,806 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand 551 states. [2019-05-15 10:15:22,806 INFO L87 Difference]: Start difference. First operand 551 states. Second operand 551 states. [2019-05-15 10:15:22,806 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:22,829 INFO L93 Difference]: Finished difference Result 551 states and 558 transitions. [2019-05-15 10:15:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 558 transitions. [2019-05-15 10:15:22,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:22,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:22,831 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand 551 states. [2019-05-15 10:15:22,831 INFO L87 Difference]: Start difference. First operand 551 states. Second operand 551 states. [2019-05-15 10:15:22,832 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:22,853 INFO L93 Difference]: Finished difference Result 551 states and 558 transitions. [2019-05-15 10:15:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 558 transitions. [2019-05-15 10:15:22,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:22,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:22,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:22,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-05-15 10:15:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 558 transitions. [2019-05-15 10:15:22,874 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 558 transitions. Word has length 5 [2019-05-15 10:15:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:22,874 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 558 transitions. [2019-05-15 10:15:22,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 558 transitions. [2019-05-15 10:15:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:15:22,875 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:22,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:15:22,878 INFO L418 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 28660961, now seen corresponding path program 1 times [2019-05-15 10:15:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:22,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:22,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:22,978 INFO L273 TraceCheckUtils]: 0: Hoare triple {10742#true} assume void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this != $null; {10747#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} is VALID [2019-05-15 10:15:22,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {10747#(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; {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-05-15 10:15:22,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} r1108 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$param_0; {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-05-15 10:15:22,988 INFO L273 TraceCheckUtils]: 3: Hoare triple {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} SimpleFrame2Cons$SimpleFrame2Cons$3$this$0762 := r1108; {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-05-15 10:15:22,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {10751#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} assume !(r0107 != $null); {10743#false} is VALID [2019-05-15 10:15:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:22,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:22,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:15:22,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:22,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:22,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:22,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:22,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:22,996 INFO L87 Difference]: Start difference. First operand 551 states and 558 transitions. Second operand 4 states. [2019-05-15 10:15:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:24,495 INFO L93 Difference]: Finished difference Result 550 states and 557 transitions. [2019-05-15 10:15:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:24,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2019-05-15 10:15:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2019-05-15 10:15:24,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 558 transitions. [2019-05-15 10:15:25,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:25,283 INFO L225 Difference]: With dead ends: 550 [2019-05-15 10:15:25,283 INFO L226 Difference]: Without dead ends: 545 [2019-05-15 10:15:25,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05-15 10:15:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-05-15 10:15:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2019-05-15 10:15:25,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:25,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 545 states. Second operand 545 states. [2019-05-15 10:15:25,293 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand 545 states. [2019-05-15 10:15:25,293 INFO L87 Difference]: Start difference. First operand 545 states. Second operand 545 states. [2019-05-15 10:15:25,293 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:25,314 INFO L93 Difference]: Finished difference Result 545 states and 553 transitions. [2019-05-15 10:15:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 553 transitions. [2019-05-15 10:15:25,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:25,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:25,316 INFO L74 IsIncluded]: Start isIncluded. First operand 545 states. Second operand 545 states. [2019-05-15 10:15:25,316 INFO L87 Difference]: Start difference. First operand 545 states. Second operand 545 states. [2019-05-15 10:15:25,316 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:25,336 INFO L93 Difference]: Finished difference Result 545 states and 553 transitions. [2019-05-15 10:15:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 553 transitions. [2019-05-15 10:15:25,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:25,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:25,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:25,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-05-15 10:15:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 553 transitions. [2019-05-15 10:15:25,361 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 553 transitions. Word has length 5 [2019-05-15 10:15:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:25,361 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 553 transitions. [2019-05-15 10:15:25,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 553 transitions. [2019-05-15 10:15:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:15:25,362 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:25,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:15:25,365 INFO L418 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash 260557076, now seen corresponding path program 1 times [2019-05-15 10:15:25,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:25,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:25,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:25,560 INFO L273 TraceCheckUtils]: 0: Hoare triple {14027#true} assume void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this != $null; {14032#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} is VALID [2019-05-15 10:15:25,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {14032#(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; {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-05-15 10:15:25,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} r194 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0; {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-05-15 10:15:25,562 INFO L273 TraceCheckUtils]: 3: Hoare triple {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711 := r194; {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-05-15 10:15:25,563 INFO L273 TraceCheckUtils]: 4: Hoare triple {14036#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} assume !(r093 != $null); {14028#false} is VALID [2019-05-15 10:15:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:25,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:25,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:15:25,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:25,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:25,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:25,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:25,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:25,569 INFO L87 Difference]: Start difference. First operand 545 states and 553 transitions. Second operand 4 states. [2019-05-15 10:15:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:26,492 INFO L93 Difference]: Finished difference Result 544 states and 552 transitions. [2019-05-15 10:15:26,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:26,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2019-05-15 10:15:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2019-05-15 10:15:26,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 553 transitions. [2019-05-15 10:15:27,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:27,242 INFO L225 Difference]: With dead ends: 544 [2019-05-15 10:15:27,243 INFO L226 Difference]: Without dead ends: 539 [2019-05-15 10:15:27,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05-15 10:15:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-05-15 10:15:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2019-05-15 10:15:27,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:27,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand 539 states. [2019-05-15 10:15:27,252 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand 539 states. [2019-05-15 10:15:27,252 INFO L87 Difference]: Start difference. First operand 539 states. Second operand 539 states. [2019-05-15 10:15:27,252 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:27,271 INFO L93 Difference]: Finished difference Result 539 states and 548 transitions. [2019-05-15 10:15:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 548 transitions. [2019-05-15 10:15:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:27,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:27,273 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand 539 states. [2019-05-15 10:15:27,273 INFO L87 Difference]: Start difference. First operand 539 states. Second operand 539 states. [2019-05-15 10:15:27,273 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:27,292 INFO L93 Difference]: Finished difference Result 539 states and 548 transitions. [2019-05-15 10:15:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 548 transitions. [2019-05-15 10:15:27,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:27,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:27,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:27,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-05-15 10:15:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 548 transitions. [2019-05-15 10:15:27,314 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 548 transitions. Word has length 5 [2019-05-15 10:15:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:27,314 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 548 transitions. [2019-05-15 10:15:27,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 548 transitions. [2019-05-15 10:15:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:15:27,315 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:27,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:15:27,318 INFO L418 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 81147768, now seen corresponding path program 1 times [2019-05-15 10:15:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:27,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:27,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:27,610 INFO L273 TraceCheckUtils]: 0: Hoare triple {17278#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:27,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null; {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:27,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:27,613 INFO L273 TraceCheckUtils]: 3: Hoare triple {17283#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {17293#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-05-15 10:15:27,615 INFO L273 TraceCheckUtils]: 4: Hoare triple {17293#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {17279#false} is VALID [2019-05-15 10:15:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:15:27,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:27,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:27,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:27,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:27,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:27,622 INFO L87 Difference]: Start difference. First operand 539 states and 548 transitions. Second operand 4 states. [2019-05-15 10:15:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:28,779 INFO L93 Difference]: Finished difference Result 527 states and 536 transitions. [2019-05-15 10:15:28,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:28,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:15:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2019-05-15 10:15:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2019-05-15 10:15:28,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 548 transitions. [2019-05-15 10:15:29,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:29,309 INFO L225 Difference]: With dead ends: 527 [2019-05-15 10:15:29,309 INFO L226 Difference]: Without dead ends: 509 [2019-05-15 10:15:29,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05-15 10:15:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-05-15 10:15:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-05-15 10:15:29,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:29,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand 509 states. [2019-05-15 10:15:29,318 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand 509 states. [2019-05-15 10:15:29,318 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 509 states. [2019-05-15 10:15:29,318 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:29,334 INFO L93 Difference]: Finished difference Result 509 states and 518 transitions. [2019-05-15 10:15:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 518 transitions. [2019-05-15 10:15:29,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:29,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:29,335 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand 509 states. [2019-05-15 10:15:29,336 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 509 states. [2019-05-15 10:15:29,336 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:29,351 INFO L93 Difference]: Finished difference Result 509 states and 518 transitions. [2019-05-15 10:15:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 518 transitions. [2019-05-15 10:15:29,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:29,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:29,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:29,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-05-15 10:15:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 518 transitions. [2019-05-15 10:15:29,364 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 518 transitions. Word has length 5 [2019-05-15 10:15:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:29,364 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 518 transitions. [2019-05-15 10:15:29,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 518 transitions. [2019-05-15 10:15:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:15:29,365 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:29,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-15 10:15:29,367 INFO L418 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1588400763, now seen corresponding path program 1 times [2019-05-15 10:15:29,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:29,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:15:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:29,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:29,468 INFO L273 TraceCheckUtils]: 0: Hoare triple {20362#true} r09 := $param_0; {20362#true} is VALID [2019-05-15 10:15:29,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {20362#true} $r110 := $fresh2; {20370#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} is VALID [2019-05-15 10:15:29,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {20370#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} assume $fresh2 != $null; {20374#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:15:29,470 INFO L273 TraceCheckUtils]: 3: Hoare triple {20374#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume $r110 != $null; {20374#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:15:29,470 INFO L273 TraceCheckUtils]: 4: Hoare triple {20374#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this := $r110; {20381#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:29,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {20381#(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); {20363#false} is VALID [2019-05-15 10:15:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:29,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:29,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-15 10:15:29,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:15:29,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:29,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:15:29,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:29,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:15:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:15:29,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:15:29,477 INFO L87 Difference]: Start difference. First operand 509 states and 518 transitions. Second operand 5 states. [2019-05-15 10:15:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:30,679 INFO L93 Difference]: Finished difference Result 508 states and 517 transitions. [2019-05-15 10:15:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:15:30,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:15:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2019-05-15 10:15:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2019-05-15 10:15:30,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 518 transitions. [2019-05-15 10:15:31,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:31,138 INFO L225 Difference]: With dead ends: 508 [2019-05-15 10:15:31,139 INFO L226 Difference]: Without dead ends: 508 [2019-05-15 10:15:31,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-05-15 10:15:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-05-15 10:15:31,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:31,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand 508 states. [2019-05-15 10:15:31,165 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand 508 states. [2019-05-15 10:15:31,165 INFO L87 Difference]: Start difference. First operand 508 states. Second operand 508 states. [2019-05-15 10:15:31,165 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:31,181 INFO L93 Difference]: Finished difference Result 508 states and 517 transitions. [2019-05-15 10:15:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 517 transitions. [2019-05-15 10:15:31,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:31,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:31,182 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand 508 states. [2019-05-15 10:15:31,182 INFO L87 Difference]: Start difference. First operand 508 states. Second operand 508 states. [2019-05-15 10:15:31,182 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:31,198 INFO L93 Difference]: Finished difference Result 508 states and 517 transitions. [2019-05-15 10:15:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 517 transitions. [2019-05-15 10:15:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:31,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:31,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-05-15 10:15:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 517 transitions. [2019-05-15 10:15:31,214 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 517 transitions. Word has length 6 [2019-05-15 10:15:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:31,214 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 517 transitions. [2019-05-15 10:15:31,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:15:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 517 transitions. [2019-05-15 10:15:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:15:31,215 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:31,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:31,217 INFO L418 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash 673596666, now seen corresponding path program 1 times [2019-05-15 10:15:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:31,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:15:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:31,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:31,286 INFO L273 TraceCheckUtils]: 0: Hoare triple {23428#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:31,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null; {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:31,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-05-15 10:15:31,288 INFO L273 TraceCheckUtils]: 3: Hoare triple {23433#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {23443#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-05-15 10:15:31,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {23443#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume r012 != $null; {23443#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-05-15 10:15:31,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {23443#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this := r012; {23450#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} is VALID [2019-05-15 10:15:31,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {23450#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} assume !(void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this != $null); {23429#false} is VALID [2019-05-15 10:15:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:31,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:31,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:15:31,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-05-15 10:15:31,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:31,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:15:31,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:31,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:15:31,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:15:31,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:15:31,301 INFO L87 Difference]: Start difference. First operand 508 states and 517 transitions. Second operand 5 states. [2019-05-15 10:15:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:32,333 INFO L93 Difference]: Finished difference Result 507 states and 516 transitions. [2019-05-15 10:15:32,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:15:32,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-05-15 10:15:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2019-05-15 10:15:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2019-05-15 10:15:32,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 517 transitions. [2019-05-15 10:15:32,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:32,819 INFO L225 Difference]: With dead ends: 507 [2019-05-15 10:15:32,819 INFO L226 Difference]: Without dead ends: 507 [2019-05-15 10:15:32,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-05-15 10:15:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-05-15 10:15:32,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:32,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand 507 states. [2019-05-15 10:15:32,827 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand 507 states. [2019-05-15 10:15:32,827 INFO L87 Difference]: Start difference. First operand 507 states. Second operand 507 states. [2019-05-15 10:15:32,827 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:32,842 INFO L93 Difference]: Finished difference Result 507 states and 516 transitions. [2019-05-15 10:15:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 516 transitions. [2019-05-15 10:15:32,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:32,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:32,843 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand 507 states. [2019-05-15 10:15:32,843 INFO L87 Difference]: Start difference. First operand 507 states. Second operand 507 states. [2019-05-15 10:15:32,843 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:32,859 INFO L93 Difference]: Finished difference Result 507 states and 516 transitions. [2019-05-15 10:15:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 516 transitions. [2019-05-15 10:15:32,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:32,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:32,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:32,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-05-15 10:15:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 516 transitions. [2019-05-15 10:15:32,874 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 516 transitions. Word has length 7 [2019-05-15 10:15:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:32,874 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 516 transitions. [2019-05-15 10:15:32,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:15:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 516 transitions. [2019-05-15 10:15:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:15:32,875 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:32,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:32,877 INFO L418 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1440708068, now seen corresponding path program 1 times [2019-05-15 10:15:32,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:32,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:15:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:32,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:32,941 INFO L273 TraceCheckUtils]: 0: Hoare triple {26491#true} assume __this != $null; {26491#true} is VALID [2019-05-15 10:15:32,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {26491#true} $caughtEx0 := $null; {26491#true} is VALID [2019-05-15 10:15:32,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {26491#true} void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {26491#true} is VALID [2019-05-15 10:15:32,941 INFO L273 TraceCheckUtils]: 3: Hoare triple {26491#true} r03 := __this; {26491#true} is VALID [2019-05-15 10:15:32,942 INFO L273 TraceCheckUtils]: 4: Hoare triple {26491#true} $r14 := $fresh1; {26508#(= void$SimpleFrame2Cons$1$run$1803_$r14 $fresh1)} is VALID [2019-05-15 10:15:32,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {26508#(= void$SimpleFrame2Cons$1$run$1803_$r14 $fresh1)} assume $fresh1 != $null; {26512#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-05-15 10:15:32,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {26512#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {26492#false} is VALID [2019-05-15 10:15:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:15:32,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-05-15 10:15:32,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:32,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:32,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:32,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:32,996 INFO L87 Difference]: Start difference. First operand 507 states and 516 transitions. Second operand 4 states. [2019-05-15 10:15:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:33,794 INFO L93 Difference]: Finished difference Result 506 states and 515 transitions. [2019-05-15 10:15:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:33,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-05-15 10:15:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2019-05-15 10:15:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2019-05-15 10:15:33,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 516 transitions. [2019-05-15 10:15:34,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:34,312 INFO L225 Difference]: With dead ends: 506 [2019-05-15 10:15:34,312 INFO L226 Difference]: Without dead ends: 506 [2019-05-15 10:15:34,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-05-15 10:15:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-05-15 10:15:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-05-15 10:15:34,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:34,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 506 states. [2019-05-15 10:15:34,320 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 506 states. [2019-05-15 10:15:34,320 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 506 states. [2019-05-15 10:15:34,320 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:34,334 INFO L93 Difference]: Finished difference Result 506 states and 515 transitions. [2019-05-15 10:15:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 515 transitions. [2019-05-15 10:15:34,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:34,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:34,335 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 506 states. [2019-05-15 10:15:34,335 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 506 states. [2019-05-15 10:15:34,335 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:34,349 INFO L93 Difference]: Finished difference Result 506 states and 515 transitions. [2019-05-15 10:15:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 515 transitions. [2019-05-15 10:15:34,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:34,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:34,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:34,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-05-15 10:15:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 515 transitions. [2019-05-15 10:15:34,360 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 515 transitions. Word has length 7 [2019-05-15 10:15:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:34,360 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 515 transitions. [2019-05-15 10:15:34,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 515 transitions. [2019-05-15 10:15:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-05-15 10:15:34,360 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:34,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:34,362 INFO L418 AbstractCegarLoop]: === Iteration 10 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1540994566, now seen corresponding path program 1 times [2019-05-15 10:15:34,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:15:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:34,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:34,421 INFO L273 TraceCheckUtils]: 0: Hoare triple {29545#true} assume __this != $null; {29545#true} is VALID [2019-05-15 10:15:34,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {29545#true} $caughtEx0 := $null; {29545#true} is VALID [2019-05-15 10:15:34,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {29545#true} void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {29545#true} is VALID [2019-05-15 10:15:34,422 INFO L273 TraceCheckUtils]: 3: Hoare triple {29545#true} r03 := __this; {29545#true} is VALID [2019-05-15 10:15:34,422 INFO L273 TraceCheckUtils]: 4: Hoare triple {29545#true} $r14 := $fresh1; {29562#(= void$SimpleFrame2Cons$1$run$1803_$r14 $fresh1)} is VALID [2019-05-15 10:15:34,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {29562#(= void$SimpleFrame2Cons$1$run$1803_$r14 $fresh1)} assume $fresh1 != $null; {29566#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-05-15 10:15:34,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {29566#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume $r14 != $null; {29566#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-05-15 10:15:34,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {29566#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this := $r14; {29573#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} is VALID [2019-05-15 10:15:34,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {29573#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} assume !(void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null); {29546#false} is VALID [2019-05-15 10:15:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:34,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-15 10:15:34,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-05-15 10:15:34,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:34,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:15:34,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:34,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:15:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:15:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:15:34,438 INFO L87 Difference]: Start difference. First operand 506 states and 515 transitions. Second operand 5 states. [2019-05-15 10:15:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:35,642 INFO L93 Difference]: Finished difference Result 505 states and 514 transitions. [2019-05-15 10:15:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:15:35,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-05-15 10:15:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2019-05-15 10:15:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2019-05-15 10:15:35,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 515 transitions. [2019-05-15 10:15:37,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:37,768 INFO L225 Difference]: With dead ends: 505 [2019-05-15 10:15:37,768 INFO L226 Difference]: Without dead ends: 505 [2019-05-15 10:15:37,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-05-15 10:15:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-05-15 10:15:37,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:37,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand 505 states. [2019-05-15 10:15:37,775 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand 505 states. [2019-05-15 10:15:37,776 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 505 states. [2019-05-15 10:15:37,776 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:37,790 INFO L93 Difference]: Finished difference Result 505 states and 514 transitions. [2019-05-15 10:15:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 514 transitions. [2019-05-15 10:15:37,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:37,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:37,792 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand 505 states. [2019-05-15 10:15:37,792 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 505 states. [2019-05-15 10:15:37,792 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:37,807 INFO L93 Difference]: Finished difference Result 505 states and 514 transitions. [2019-05-15 10:15:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 514 transitions. [2019-05-15 10:15:37,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:37,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:37,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:37,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-05-15 10:15:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 514 transitions. [2019-05-15 10:15:37,823 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 514 transitions. Word has length 9 [2019-05-15 10:15:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:37,823 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 514 transitions. [2019-05-15 10:15:37,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:15:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 514 transitions. [2019-05-15 10:15:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-05-15 10:15:37,824 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:37,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:37,825 INFO L418 AbstractCegarLoop]: === Iteration 11 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1134431000, now seen corresponding path program 1 times [2019-05-15 10:15:37,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:37,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:15:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:37,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:37,904 INFO L273 TraceCheckUtils]: 0: Hoare triple {32602#true} r09 := $param_0; {32602#true} is VALID [2019-05-15 10:15:37,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {32602#true} $r110 := $fresh2; {32610#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} is VALID [2019-05-15 10:15:37,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {32610#(= void$SimpleFrame2Cons$main$1804_$r110 $fresh2)} assume $fresh2 != $null; {32614#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:15:37,906 INFO L273 TraceCheckUtils]: 3: Hoare triple {32614#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume $r110 != $null; {32614#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:15:37,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {32614#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this := $r110; {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:37,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {32621#(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; {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:37,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {32621#(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; {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:37,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} havoc void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01, void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep2, void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3, void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep0, void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1; {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-05-15 10:15:37,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {32621#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 := void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this; {32634#(not (= void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-05-15 10:15:37,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {32634#(not (= void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} assume !(void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 != $null); {32603#false} is VALID [2019-05-15 10:15:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:37,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-05-15 10:15:37,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-05-15 10:15:37,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:37,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:15:37,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:37,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:15:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:15:37,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:15:37,929 INFO L87 Difference]: Start difference. First operand 505 states and 514 transitions. Second operand 6 states. [2019-05-15 10:15:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:39,500 INFO L93 Difference]: Finished difference Result 504 states and 513 transitions. [2019-05-15 10:15:39,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:15:39,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-05-15 10:15:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2019-05-15 10:15:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2019-05-15 10:15:39,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 514 transitions. [2019-05-15 10:15:39,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:39,910 INFO L225 Difference]: With dead ends: 504 [2019-05-15 10:15:39,910 INFO L226 Difference]: Without dead ends: 494 [2019-05-15 10:15:39,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:15:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-05-15 10:15:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-05-15 10:15:39,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:39,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 494 states. Second operand 494 states. [2019-05-15 10:15:39,918 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand 494 states. [2019-05-15 10:15:39,918 INFO L87 Difference]: Start difference. First operand 494 states. Second operand 494 states. [2019-05-15 10:15:39,918 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:39,933 INFO L93 Difference]: Finished difference Result 494 states and 504 transitions. [2019-05-15 10:15:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 504 transitions. [2019-05-15 10:15:39,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:39,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:39,935 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand 494 states. [2019-05-15 10:15:39,935 INFO L87 Difference]: Start difference. First operand 494 states. Second operand 494 states. [2019-05-15 10:15:39,935 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:15:39,965 INFO L93 Difference]: Finished difference Result 494 states and 504 transitions. [2019-05-15 10:15:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 504 transitions. [2019-05-15 10:15:39,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:39,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:39,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:39,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-05-15 10:15:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 504 transitions. [2019-05-15 10:15:39,979 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 504 transitions. Word has length 10 [2019-05-15 10:15:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:39,980 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 504 transitions. [2019-05-15 10:15:39,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:15:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 504 transitions. [2019-05-15 10:15:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-05-15 10:15:39,980 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:39,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:39,981 INFO L418 AbstractCegarLoop]: === Iteration 12 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -118089624, now seen corresponding path program 1 times [2019-05-15 10:15:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-05-15 10:15:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-05-15 10:15:40,019 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-05-15 10:15:40,030 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:15:40 BoogieIcfgContainer [2019-05-15 10:15:40,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:15:40,034 INFO L168 Benchmark]: Toolchain (without parser) took 29313.42 ms. Allocated memory was 131.6 MB in the beginning and 513.8 MB in the end (delta: 382.2 MB). Free memory was 106.9 MB in the beginning and 484.1 MB in the end (delta: -377.2 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:40,036 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:40,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.61 ms. Allocated memory is still 131.6 MB. Free memory was 106.7 MB in the beginning and 101.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:40,037 INFO L168 Benchmark]: Boogie Preprocessor took 62.25 ms. Allocated memory is still 131.6 MB. Free memory was 101.5 MB in the beginning and 99.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:40,038 INFO L168 Benchmark]: RCFGBuilder took 3279.36 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 164.6 MB in the end (delta: -65.3 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:40,039 INFO L168 Benchmark]: TraceAbstraction took 25836.53 ms. Allocated memory was 194.5 MB in the beginning and 513.8 MB in the end (delta: 319.3 MB). Free memory was 164.6 MB in the beginning and 484.1 MB in the end (delta: -319.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:40,044 INFO L337 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.24 ms. Allocated memory is still 131.6 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.61 ms. Allocated memory is still 131.6 MB. Free memory was 106.7 MB in the beginning and 101.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.25 ms. Allocated memory is still 131.6 MB. Free memory was 101.5 MB in the beginning and 99.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3279.36 ms. Allocated memory was 131.6 MB in the beginning and 194.5 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 164.6 MB in the end (delta: -65.3 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25836.53 ms. Allocated memory was 194.5 MB in the beginning and 513.8 MB in the end (delta: 319.3 MB). Free memory was 164.6 MB in the beginning and 484.1 MB in the end (delta: -319.5 MB). There was no memory consumed. 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, 645 locations, 87 error locations. UNSAFE Result, 25.7s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5924 SDtfs, 1503 SDslu, 12981 SDs, 0 SdLazy, 82 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=645occurred 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.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 16 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...