/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/psyco/psyco_security.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-8fc6572
[2020-07-11 02:21:04,808 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-11 02:21:04,810 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-11 02:21:04,822 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-11 02:21:04,823 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-11 02:21:04,824 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-11 02:21:04,825 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-11 02:21:04,827 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-11 02:21:04,829 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-11 02:21:04,830 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-11 02:21:04,830 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-11 02:21:04,832 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-11 02:21:04,832 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-11 02:21:04,833 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-11 02:21:04,834 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-11 02:21:04,835 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-11 02:21:04,836 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-11 02:21:04,837 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-11 02:21:04,839 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-11 02:21:04,841 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-11 02:21:04,843 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-11 02:21:04,844 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-11 02:21:04,845 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-11 02:21:04,846 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-11 02:21:04,849 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-11 02:21:04,849 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-11 02:21:04,849 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-11 02:21:04,850 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-11 02:21:04,851 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-11 02:21:04,852 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-11 02:21:04,852 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-11 02:21:04,853 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-11 02:21:04,854 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-11 02:21:04,854 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-11 02:21:04,856 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-11 02:21:04,856 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-11 02:21:04,857 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-11 02:21:04,857 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-11 02:21:04,857 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-11 02:21:04,858 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-11 02:21:04,859 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-11 02:21:04,860 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-11 02:21:04,876 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-11 02:21:04,877 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-11 02:21:04,878 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-11 02:21:04,878 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-11 02:21:04,878 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-11 02:21:04,878 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-11 02:21:04,878 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-11 02:21:04,879 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-11 02:21:04,879 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-11 02:21:04,879 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-11 02:21:04,879 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-11 02:21:04,879 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-11 02:21:04,880 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-11 02:21:04,880 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-11 02:21:04,880 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-11 02:21:04,880 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-07-11 02:21:04,880 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-11 02:21:04,881 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-11 02:21:04,881 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-11 02:21:04,881 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-11 02:21:04,881 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-11 02:21:04,881 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-11 02:21:04,882 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true
[2020-07-11 02:21:05,167 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-11 02:21:05,180 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-11 02:21:05,183 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-11 02:21:05,185 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-11 02:21:05,185 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-11 02:21:05,186 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c
[2020-07-11 02:21:05,267 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c0c0d35/76fe8eb2af334ec49cfbdd2155ee9489/FLAGcc9fb6d36
[2020-07-11 02:21:05,769 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-11 02:21:05,769 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c
[2020-07-11 02:21:05,785 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c0c0d35/76fe8eb2af334ec49cfbdd2155ee9489/FLAGcc9fb6d36
[2020-07-11 02:21:06,139 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c0c0d35/76fe8eb2af334ec49cfbdd2155ee9489
[2020-07-11 02:21:06,149 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-11 02:21:06,151 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-11 02:21:06,153 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-11 02:21:06,153 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-11 02:21:06,156 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-11 02:21:06,158 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,161 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd34c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06, skipping insertion in model container
[2020-07-11 02:21:06,161 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,169 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-11 02:21:06,196 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-11 02:21:06,415 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-11 02:21:06,423 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-11 02:21:06,470 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-11 02:21:06,584 INFO  L208         MainTranslator]: Completed translation
[2020-07-11 02:21:06,585 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06 WrapperNode
[2020-07-11 02:21:06,585 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-11 02:21:06,586 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-11 02:21:06,586 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-11 02:21:06,586 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-11 02:21:06,602 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,603 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,623 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,624 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,645 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,670 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,673 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
[2020-07-11 02:21:06,676 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-11 02:21:06,685 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-11 02:21:06,685 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-11 02:21:06,685 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-11 02:21:06,686 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-11 02:21:06,753 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-11 02:21:06,753 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-11 02:21:06,753 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-11 02:21:06,754 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-11 02:21:06,754 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-11 02:21:06,754 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-11 02:21:06,754 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-11 02:21:06,754 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-11 02:21:07,543 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-11 02:21:07,543 INFO  L295             CfgBuilder]: Removed 18 assume(true) statements.
[2020-07-11 02:21:07,549 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:21:07 BoogieIcfgContainer
[2020-07-11 02:21:07,549 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-11 02:21:07,551 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-11 02:21:07,551 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-11 02:21:07,554 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-11 02:21:07,554 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:21:06" (1/3) ...
[2020-07-11 02:21:07,555 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245da05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:21:07, skipping insertion in model container
[2020-07-11 02:21:07,556 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:21:06" (2/3) ...
[2020-07-11 02:21:07,556 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245da05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:21:07, skipping insertion in model container
[2020-07-11 02:21:07,556 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:21:07" (3/3) ...
[2020-07-11 02:21:07,558 INFO  L109   eAbstractionObserver]: Analyzing ICFG psyco_security.c
[2020-07-11 02:21:07,569 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-11 02:21:07,577 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-11 02:21:07,590 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-11 02:21:07,609 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-11 02:21:07,610 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-11 02:21:07,610 INFO  L377      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-07-11 02:21:07,610 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-11 02:21:07,610 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-11 02:21:07,611 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-11 02:21:07,611 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-11 02:21:07,611 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-11 02:21:07,631 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states.
[2020-07-11 02:21:07,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-07-11 02:21:07,644 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:07,645 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:07,645 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:07,652 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:07,652 INFO  L82        PathProgramCache]: Analyzing trace with hash -1507146259, now seen corresponding path program 1 times
[2020-07-11 02:21:07,662 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:07,663 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371430799]
[2020-07-11 02:21:07,663 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:07,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:07,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:07,872 INFO  L280        TraceCheckUtils]: 0: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID
[2020-07-11 02:21:07,872 INFO  L280        TraceCheckUtils]: 1: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID
[2020-07-11 02:21:07,873 INFO  L280        TraceCheckUtils]: 2: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID
[2020-07-11 02:21:07,873 INFO  L280        TraceCheckUtils]: 3: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID
[2020-07-11 02:21:07,874 INFO  L280        TraceCheckUtils]: 4: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID
[2020-07-11 02:21:07,874 INFO  L280        TraceCheckUtils]: 5: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID
[2020-07-11 02:21:07,875 INFO  L280        TraceCheckUtils]: 6: Hoare triple {194#true} assume true; {194#true} is VALID
[2020-07-11 02:21:07,875 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID
[2020-07-11 02:21:07,881 INFO  L263        TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:07,881 INFO  L280        TraceCheckUtils]: 1: Hoare triple {204#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {194#true} is VALID
[2020-07-11 02:21:07,882 INFO  L280        TraceCheckUtils]: 2: Hoare triple {194#true} ~m_initVerify~0 := 2; {194#true} is VALID
[2020-07-11 02:21:07,882 INFO  L280        TraceCheckUtils]: 3: Hoare triple {194#true} ~m_Signature~0 := 3; {194#true} is VALID
[2020-07-11 02:21:07,882 INFO  L280        TraceCheckUtils]: 4: Hoare triple {194#true} ~m_sign~0 := 4; {194#true} is VALID
[2020-07-11 02:21:07,883 INFO  L280        TraceCheckUtils]: 5: Hoare triple {194#true} ~m_verify~0 := 5; {194#true} is VALID
[2020-07-11 02:21:07,883 INFO  L280        TraceCheckUtils]: 6: Hoare triple {194#true} ~m_update~0 := 6; {194#true} is VALID
[2020-07-11 02:21:07,883 INFO  L280        TraceCheckUtils]: 7: Hoare triple {194#true} assume true; {194#true} is VALID
[2020-07-11 02:21:07,884 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {194#true} {194#true} #484#return; {194#true} is VALID
[2020-07-11 02:21:07,884 INFO  L263        TraceCheckUtils]: 9: Hoare triple {194#true} call #t~ret21 := main(); {194#true} is VALID
[2020-07-11 02:21:07,885 INFO  L280        TraceCheckUtils]: 10: Hoare triple {194#true} ~q~0 := 0; {194#true} is VALID
[2020-07-11 02:21:07,885 INFO  L280        TraceCheckUtils]: 11: Hoare triple {194#true} havoc ~method_id~0; {194#true} is VALID
[2020-07-11 02:21:07,886 INFO  L280        TraceCheckUtils]: 12: Hoare triple {194#true} ~this_state~0 := 0; {194#true} is VALID
[2020-07-11 02:21:07,886 INFO  L280        TraceCheckUtils]: 13: Hoare triple {194#true} goto; {194#true} is VALID
[2020-07-11 02:21:07,886 INFO  L280        TraceCheckUtils]: 14: Hoare triple {194#true} assume !false; {194#true} is VALID
[2020-07-11 02:21:07,887 INFO  L280        TraceCheckUtils]: 15: Hoare triple {194#true} assume 0 == ~q~0; {194#true} is VALID
[2020-07-11 02:21:07,887 INFO  L280        TraceCheckUtils]: 16: Hoare triple {194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {194#true} is VALID
[2020-07-11 02:21:07,888 INFO  L280        TraceCheckUtils]: 17: Hoare triple {194#true} assume 0 != #t~nondet0; {194#true} is VALID
[2020-07-11 02:21:07,888 INFO  L280        TraceCheckUtils]: 18: Hoare triple {194#true} havoc #t~nondet0; {194#true} is VALID
[2020-07-11 02:21:07,889 INFO  L280        TraceCheckUtils]: 19: Hoare triple {194#true} ~method_id~0 := 3; {194#true} is VALID
[2020-07-11 02:21:07,895 INFO  L280        TraceCheckUtils]: 20: Hoare triple {194#true} assume false; {195#false} is VALID
[2020-07-11 02:21:07,895 INFO  L280        TraceCheckUtils]: 21: Hoare triple {195#false} assume !false; {195#false} is VALID
[2020-07-11 02:21:07,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-11 02:21:07,899 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371430799]
[2020-07-11 02:21:07,902 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:07,902 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-11 02:21:07,903 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083652736]
[2020-07-11 02:21:07,909 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2020-07-11 02:21:07,912 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:07,916 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-11 02:21:07,957 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:07,958 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-11 02:21:07,958 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:07,983 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-11 02:21:07,984 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-11 02:21:07,986 INFO  L87              Difference]: Start difference. First operand 191 states. Second operand 3 states.
[2020-07-11 02:21:09,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:09,344 INFO  L93              Difference]: Finished difference Result 369 states and 507 transitions.
[2020-07-11 02:21:09,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-07-11 02:21:09,344 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2020-07-11 02:21:09,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:09,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-11 02:21:09,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions.
[2020-07-11 02:21:09,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-11 02:21:09,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions.
[2020-07-11 02:21:09,377 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 507 transitions.
[2020-07-11 02:21:10,089 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:10,111 INFO  L225             Difference]: With dead ends: 369
[2020-07-11 02:21:10,111 INFO  L226             Difference]: Without dead ends: 178
[2020-07-11 02:21:10,116 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-11 02:21:10,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2020-07-11 02:21:10,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178.
[2020-07-11 02:21:10,744 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:10,745 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 178 states.
[2020-07-11 02:21:10,745 INFO  L74              IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states.
[2020-07-11 02:21:10,746 INFO  L87              Difference]: Start difference. First operand 178 states. Second operand 178 states.
[2020-07-11 02:21:10,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:10,758 INFO  L93              Difference]: Finished difference Result 178 states and 213 transitions.
[2020-07-11 02:21:10,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions.
[2020-07-11 02:21:10,760 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:10,760 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:10,761 INFO  L74              IsIncluded]: Start isIncluded. First operand 178 states. Second operand 178 states.
[2020-07-11 02:21:10,761 INFO  L87              Difference]: Start difference. First operand 178 states. Second operand 178 states.
[2020-07-11 02:21:10,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:10,771 INFO  L93              Difference]: Finished difference Result 178 states and 213 transitions.
[2020-07-11 02:21:10,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions.
[2020-07-11 02:21:10,773 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:10,773 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:10,773 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:10,773 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:10,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2020-07-11 02:21:10,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions.
[2020-07-11 02:21:10,784 INFO  L78                 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 22
[2020-07-11 02:21:10,784 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:10,785 INFO  L479      AbstractCegarLoop]: Abstraction has 178 states and 213 transitions.
[2020-07-11 02:21:10,785 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-11 02:21:10,785 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 178 states and 213 transitions.
[2020-07-11 02:21:11,071 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:11,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions.
[2020-07-11 02:21:11,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-07-11 02:21:11,074 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:11,074 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:11,075 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-11 02:21:11,075 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:11,075 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:11,076 INFO  L82        PathProgramCache]: Analyzing trace with hash -946920198, now seen corresponding path program 1 times
[2020-07-11 02:21:11,077 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:11,077 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [561407743]
[2020-07-11 02:21:11,077 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:11,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:11,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:11,189 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID
[2020-07-11 02:21:11,190 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID
[2020-07-11 02:21:11,190 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID
[2020-07-11 02:21:11,190 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID
[2020-07-11 02:21:11,191 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID
[2020-07-11 02:21:11,191 INFO  L280        TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID
[2020-07-11 02:21:11,191 INFO  L280        TraceCheckUtils]: 6: Hoare triple {1657#true} assume true; {1657#true} is VALID
[2020-07-11 02:21:11,191 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID
[2020-07-11 02:21:11,193 INFO  L263        TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:11,193 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1668#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {1657#true} is VALID
[2020-07-11 02:21:11,194 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1657#true} ~m_initVerify~0 := 2; {1657#true} is VALID
[2020-07-11 02:21:11,194 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1657#true} ~m_Signature~0 := 3; {1657#true} is VALID
[2020-07-11 02:21:11,194 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1657#true} ~m_sign~0 := 4; {1657#true} is VALID
[2020-07-11 02:21:11,194 INFO  L280        TraceCheckUtils]: 5: Hoare triple {1657#true} ~m_verify~0 := 5; {1657#true} is VALID
[2020-07-11 02:21:11,195 INFO  L280        TraceCheckUtils]: 6: Hoare triple {1657#true} ~m_update~0 := 6; {1657#true} is VALID
[2020-07-11 02:21:11,195 INFO  L280        TraceCheckUtils]: 7: Hoare triple {1657#true} assume true; {1657#true} is VALID
[2020-07-11 02:21:11,195 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {1657#true} {1657#true} #484#return; {1657#true} is VALID
[2020-07-11 02:21:11,196 INFO  L263        TraceCheckUtils]: 9: Hoare triple {1657#true} call #t~ret21 := main(); {1657#true} is VALID
[2020-07-11 02:21:11,196 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1657#true} ~q~0 := 0; {1667#(= 0 main_~q~0)} is VALID
[2020-07-11 02:21:11,197 INFO  L280        TraceCheckUtils]: 11: Hoare triple {1667#(= 0 main_~q~0)} havoc ~method_id~0; {1667#(= 0 main_~q~0)} is VALID
[2020-07-11 02:21:11,198 INFO  L280        TraceCheckUtils]: 12: Hoare triple {1667#(= 0 main_~q~0)} ~this_state~0 := 0; {1667#(= 0 main_~q~0)} is VALID
[2020-07-11 02:21:11,198 INFO  L280        TraceCheckUtils]: 13: Hoare triple {1667#(= 0 main_~q~0)} goto; {1667#(= 0 main_~q~0)} is VALID
[2020-07-11 02:21:11,199 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1667#(= 0 main_~q~0)} assume !false; {1667#(= 0 main_~q~0)} is VALID
[2020-07-11 02:21:11,200 INFO  L280        TraceCheckUtils]: 15: Hoare triple {1667#(= 0 main_~q~0)} assume !(0 == ~q~0); {1658#false} is VALID
[2020-07-11 02:21:11,200 INFO  L280        TraceCheckUtils]: 16: Hoare triple {1658#false} assume 1 == ~q~0; {1658#false} is VALID
[2020-07-11 02:21:11,200 INFO  L280        TraceCheckUtils]: 17: Hoare triple {1658#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1658#false} is VALID
[2020-07-11 02:21:11,200 INFO  L280        TraceCheckUtils]: 18: Hoare triple {1658#false} assume 0 != #t~nondet1; {1658#false} is VALID
[2020-07-11 02:21:11,201 INFO  L280        TraceCheckUtils]: 19: Hoare triple {1658#false} havoc #t~nondet1; {1658#false} is VALID
[2020-07-11 02:21:11,201 INFO  L280        TraceCheckUtils]: 20: Hoare triple {1658#false} ~method_id~0 := 4; {1658#false} is VALID
[2020-07-11 02:21:11,201 INFO  L280        TraceCheckUtils]: 21: Hoare triple {1658#false} assume 2 == ~this_state~0; {1658#false} is VALID
[2020-07-11 02:21:11,202 INFO  L280        TraceCheckUtils]: 22: Hoare triple {1658#false} assume !false; {1658#false} is VALID
[2020-07-11 02:21:11,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-11 02:21:11,203 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [561407743]
[2020-07-11 02:21:11,203 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:11,203 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:11,204 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883615515]
[2020-07-11 02:21:11,205 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-07-11 02:21:11,206 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:11,206 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:11,227 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:11,228 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:11,228 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:11,228 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:11,229 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:11,229 INFO  L87              Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 4 states.
[2020-07-11 02:21:12,697 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:12,698 INFO  L93              Difference]: Finished difference Result 346 states and 417 transitions.
[2020-07-11 02:21:12,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:12,698 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-07-11 02:21:12,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:12,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:12,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions.
[2020-07-11 02:21:12,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:12,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions.
[2020-07-11 02:21:12,710 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 417 transitions.
[2020-07-11 02:21:13,189 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:13,195 INFO  L225             Difference]: With dead ends: 346
[2020-07-11 02:21:13,195 INFO  L226             Difference]: Without dead ends: 181
[2020-07-11 02:21:13,197 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-07-11 02:21:13,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2020-07-11 02:21:13,763 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181.
[2020-07-11 02:21:13,764 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:13,764 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 181 states.
[2020-07-11 02:21:13,764 INFO  L74              IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states.
[2020-07-11 02:21:13,764 INFO  L87              Difference]: Start difference. First operand 181 states. Second operand 181 states.
[2020-07-11 02:21:13,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:13,779 INFO  L93              Difference]: Finished difference Result 181 states and 216 transitions.
[2020-07-11 02:21:13,779 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions.
[2020-07-11 02:21:13,780 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:13,781 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:13,781 INFO  L74              IsIncluded]: Start isIncluded. First operand 181 states. Second operand 181 states.
[2020-07-11 02:21:13,781 INFO  L87              Difference]: Start difference. First operand 181 states. Second operand 181 states.
[2020-07-11 02:21:13,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:13,794 INFO  L93              Difference]: Finished difference Result 181 states and 216 transitions.
[2020-07-11 02:21:13,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions.
[2020-07-11 02:21:13,795 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:13,795 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:13,795 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:13,795 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:13,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 181 states.
[2020-07-11 02:21:13,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions.
[2020-07-11 02:21:13,808 INFO  L78                 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23
[2020-07-11 02:21:13,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:13,808 INFO  L479      AbstractCegarLoop]: Abstraction has 181 states and 216 transitions.
[2020-07-11 02:21:13,808 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:13,809 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 216 transitions.
[2020-07-11 02:21:14,097 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:14,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions.
[2020-07-11 02:21:14,098 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2020-07-11 02:21:14,099 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:14,099 INFO  L422         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:14,099 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-11 02:21:14,099 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:14,100 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:14,100 INFO  L82        PathProgramCache]: Analyzing trace with hash 1840173547, now seen corresponding path program 1 times
[2020-07-11 02:21:14,100 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:14,100 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612870410]
[2020-07-11 02:21:14,100 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:14,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:14,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:14,167 INFO  L280        TraceCheckUtils]: 0: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID
[2020-07-11 02:21:14,167 INFO  L280        TraceCheckUtils]: 1: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID
[2020-07-11 02:21:14,168 INFO  L280        TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID
[2020-07-11 02:21:14,168 INFO  L280        TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID
[2020-07-11 02:21:14,168 INFO  L280        TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID
[2020-07-11 02:21:14,168 INFO  L280        TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID
[2020-07-11 02:21:14,169 INFO  L280        TraceCheckUtils]: 6: Hoare triple {3089#true} assume true; {3089#true} is VALID
[2020-07-11 02:21:14,169 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID
[2020-07-11 02:21:14,170 INFO  L263        TraceCheckUtils]: 0: Hoare triple {3089#true} call ULTIMATE.init(); {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:14,170 INFO  L280        TraceCheckUtils]: 1: Hoare triple {3100#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {3089#true} is VALID
[2020-07-11 02:21:14,170 INFO  L280        TraceCheckUtils]: 2: Hoare triple {3089#true} ~m_initVerify~0 := 2; {3089#true} is VALID
[2020-07-11 02:21:14,171 INFO  L280        TraceCheckUtils]: 3: Hoare triple {3089#true} ~m_Signature~0 := 3; {3089#true} is VALID
[2020-07-11 02:21:14,171 INFO  L280        TraceCheckUtils]: 4: Hoare triple {3089#true} ~m_sign~0 := 4; {3089#true} is VALID
[2020-07-11 02:21:14,171 INFO  L280        TraceCheckUtils]: 5: Hoare triple {3089#true} ~m_verify~0 := 5; {3089#true} is VALID
[2020-07-11 02:21:14,171 INFO  L280        TraceCheckUtils]: 6: Hoare triple {3089#true} ~m_update~0 := 6; {3089#true} is VALID
[2020-07-11 02:21:14,171 INFO  L280        TraceCheckUtils]: 7: Hoare triple {3089#true} assume true; {3089#true} is VALID
[2020-07-11 02:21:14,172 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {3089#true} {3089#true} #484#return; {3089#true} is VALID
[2020-07-11 02:21:14,172 INFO  L263        TraceCheckUtils]: 9: Hoare triple {3089#true} call #t~ret21 := main(); {3089#true} is VALID
[2020-07-11 02:21:14,172 INFO  L280        TraceCheckUtils]: 10: Hoare triple {3089#true} ~q~0 := 0; {3089#true} is VALID
[2020-07-11 02:21:14,172 INFO  L280        TraceCheckUtils]: 11: Hoare triple {3089#true} havoc ~method_id~0; {3089#true} is VALID
[2020-07-11 02:21:14,172 INFO  L280        TraceCheckUtils]: 12: Hoare triple {3089#true} ~this_state~0 := 0; {3089#true} is VALID
[2020-07-11 02:21:14,173 INFO  L280        TraceCheckUtils]: 13: Hoare triple {3089#true} goto; {3089#true} is VALID
[2020-07-11 02:21:14,173 INFO  L280        TraceCheckUtils]: 14: Hoare triple {3089#true} assume !false; {3089#true} is VALID
[2020-07-11 02:21:14,173 INFO  L280        TraceCheckUtils]: 15: Hoare triple {3089#true} assume 0 == ~q~0; {3089#true} is VALID
[2020-07-11 02:21:14,173 INFO  L280        TraceCheckUtils]: 16: Hoare triple {3089#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3089#true} is VALID
[2020-07-11 02:21:14,174 INFO  L280        TraceCheckUtils]: 17: Hoare triple {3089#true} assume 0 != #t~nondet0; {3089#true} is VALID
[2020-07-11 02:21:14,174 INFO  L280        TraceCheckUtils]: 18: Hoare triple {3089#true} havoc #t~nondet0; {3089#true} is VALID
[2020-07-11 02:21:14,174 INFO  L280        TraceCheckUtils]: 19: Hoare triple {3089#true} ~method_id~0 := 3; {3089#true} is VALID
[2020-07-11 02:21:14,174 INFO  L280        TraceCheckUtils]: 20: Hoare triple {3089#true} assume !false; {3089#true} is VALID
[2020-07-11 02:21:14,177 INFO  L280        TraceCheckUtils]: 21: Hoare triple {3089#true} ~q~0 := 2; {3099#(<= 2 main_~q~0)} is VALID
[2020-07-11 02:21:14,177 INFO  L280        TraceCheckUtils]: 22: Hoare triple {3099#(<= 2 main_~q~0)} ~this_state~0 := 0; {3099#(<= 2 main_~q~0)} is VALID
[2020-07-11 02:21:14,178 INFO  L280        TraceCheckUtils]: 23: Hoare triple {3099#(<= 2 main_~q~0)} assume !false; {3099#(<= 2 main_~q~0)} is VALID
[2020-07-11 02:21:14,179 INFO  L280        TraceCheckUtils]: 24: Hoare triple {3099#(<= 2 main_~q~0)} assume !(0 == ~q~0); {3099#(<= 2 main_~q~0)} is VALID
[2020-07-11 02:21:14,180 INFO  L280        TraceCheckUtils]: 25: Hoare triple {3099#(<= 2 main_~q~0)} assume 1 == ~q~0; {3090#false} is VALID
[2020-07-11 02:21:14,180 INFO  L280        TraceCheckUtils]: 26: Hoare triple {3090#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3090#false} is VALID
[2020-07-11 02:21:14,180 INFO  L280        TraceCheckUtils]: 27: Hoare triple {3090#false} assume 0 != #t~nondet1; {3090#false} is VALID
[2020-07-11 02:21:14,180 INFO  L280        TraceCheckUtils]: 28: Hoare triple {3090#false} havoc #t~nondet1; {3090#false} is VALID
[2020-07-11 02:21:14,181 INFO  L280        TraceCheckUtils]: 29: Hoare triple {3090#false} ~method_id~0 := 4; {3090#false} is VALID
[2020-07-11 02:21:14,181 INFO  L280        TraceCheckUtils]: 30: Hoare triple {3090#false} assume 2 == ~this_state~0; {3090#false} is VALID
[2020-07-11 02:21:14,181 INFO  L280        TraceCheckUtils]: 31: Hoare triple {3090#false} assume !false; {3090#false} is VALID
[2020-07-11 02:21:14,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-11 02:21:14,183 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612870410]
[2020-07-11 02:21:14,184 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:14,184 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:14,184 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520006395]
[2020-07-11 02:21:14,185 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2020-07-11 02:21:14,185 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:14,185 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:14,224 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:14,225 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:14,225 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:14,225 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:14,225 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:14,226 INFO  L87              Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 4 states.
[2020-07-11 02:21:15,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:15,288 INFO  L93              Difference]: Finished difference Result 330 states and 397 transitions.
[2020-07-11 02:21:15,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:15,289 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2020-07-11 02:21:15,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:15,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:15,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions.
[2020-07-11 02:21:15,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:15,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions.
[2020-07-11 02:21:15,301 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 395 transitions.
[2020-07-11 02:21:15,808 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:15,812 INFO  L225             Difference]: With dead ends: 330
[2020-07-11 02:21:15,812 INFO  L226             Difference]: Without dead ends: 163
[2020-07-11 02:21:15,813 INFO  L675         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
[2020-07-11 02:21:15,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 163 states.
[2020-07-11 02:21:16,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163.
[2020-07-11 02:21:16,345 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:16,345 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 163 states.
[2020-07-11 02:21:16,345 INFO  L74              IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states.
[2020-07-11 02:21:16,346 INFO  L87              Difference]: Start difference. First operand 163 states. Second operand 163 states.
[2020-07-11 02:21:16,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:16,355 INFO  L93              Difference]: Finished difference Result 163 states and 193 transitions.
[2020-07-11 02:21:16,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions.
[2020-07-11 02:21:16,356 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:16,357 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:16,357 INFO  L74              IsIncluded]: Start isIncluded. First operand 163 states. Second operand 163 states.
[2020-07-11 02:21:16,357 INFO  L87              Difference]: Start difference. First operand 163 states. Second operand 163 states.
[2020-07-11 02:21:16,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:16,367 INFO  L93              Difference]: Finished difference Result 163 states and 193 transitions.
[2020-07-11 02:21:16,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions.
[2020-07-11 02:21:16,368 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:16,369 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:16,370 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:16,370 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:16,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 163 states.
[2020-07-11 02:21:16,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions.
[2020-07-11 02:21:16,384 INFO  L78                 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 32
[2020-07-11 02:21:16,385 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:16,385 INFO  L479      AbstractCegarLoop]: Abstraction has 163 states and 193 transitions.
[2020-07-11 02:21:16,385 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:16,385 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 163 states and 193 transitions.
[2020-07-11 02:21:16,705 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:16,706 INFO  L276                IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions.
[2020-07-11 02:21:16,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2020-07-11 02:21:16,707 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:16,707 INFO  L422         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:16,708 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-11 02:21:16,708 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:16,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:16,710 INFO  L82        PathProgramCache]: Analyzing trace with hash 576498569, now seen corresponding path program 1 times
[2020-07-11 02:21:16,710 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:16,711 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182615695]
[2020-07-11 02:21:16,711 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:16,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:16,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:16,832 INFO  L280        TraceCheckUtils]: 0: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID
[2020-07-11 02:21:16,833 INFO  L280        TraceCheckUtils]: 1: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID
[2020-07-11 02:21:16,833 INFO  L280        TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID
[2020-07-11 02:21:16,833 INFO  L280        TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID
[2020-07-11 02:21:16,834 INFO  L280        TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID
[2020-07-11 02:21:16,834 INFO  L280        TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID
[2020-07-11 02:21:16,834 INFO  L280        TraceCheckUtils]: 6: Hoare triple {4418#true} assume true; {4418#true} is VALID
[2020-07-11 02:21:16,834 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID
[2020-07-11 02:21:16,842 INFO  L263        TraceCheckUtils]: 0: Hoare triple {4418#true} call ULTIMATE.init(); {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:16,842 INFO  L280        TraceCheckUtils]: 1: Hoare triple {4429#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {4418#true} is VALID
[2020-07-11 02:21:16,842 INFO  L280        TraceCheckUtils]: 2: Hoare triple {4418#true} ~m_initVerify~0 := 2; {4418#true} is VALID
[2020-07-11 02:21:16,843 INFO  L280        TraceCheckUtils]: 3: Hoare triple {4418#true} ~m_Signature~0 := 3; {4418#true} is VALID
[2020-07-11 02:21:16,843 INFO  L280        TraceCheckUtils]: 4: Hoare triple {4418#true} ~m_sign~0 := 4; {4418#true} is VALID
[2020-07-11 02:21:16,843 INFO  L280        TraceCheckUtils]: 5: Hoare triple {4418#true} ~m_verify~0 := 5; {4418#true} is VALID
[2020-07-11 02:21:16,844 INFO  L280        TraceCheckUtils]: 6: Hoare triple {4418#true} ~m_update~0 := 6; {4418#true} is VALID
[2020-07-11 02:21:16,844 INFO  L280        TraceCheckUtils]: 7: Hoare triple {4418#true} assume true; {4418#true} is VALID
[2020-07-11 02:21:16,845 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {4418#true} {4418#true} #484#return; {4418#true} is VALID
[2020-07-11 02:21:16,845 INFO  L263        TraceCheckUtils]: 9: Hoare triple {4418#true} call #t~ret21 := main(); {4418#true} is VALID
[2020-07-11 02:21:16,845 INFO  L280        TraceCheckUtils]: 10: Hoare triple {4418#true} ~q~0 := 0; {4418#true} is VALID
[2020-07-11 02:21:16,846 INFO  L280        TraceCheckUtils]: 11: Hoare triple {4418#true} havoc ~method_id~0; {4418#true} is VALID
[2020-07-11 02:21:16,846 INFO  L280        TraceCheckUtils]: 12: Hoare triple {4418#true} ~this_state~0 := 0; {4418#true} is VALID
[2020-07-11 02:21:16,853 INFO  L280        TraceCheckUtils]: 13: Hoare triple {4418#true} goto; {4418#true} is VALID
[2020-07-11 02:21:16,854 INFO  L280        TraceCheckUtils]: 14: Hoare triple {4418#true} assume !false; {4418#true} is VALID
[2020-07-11 02:21:16,854 INFO  L280        TraceCheckUtils]: 15: Hoare triple {4418#true} assume 0 == ~q~0; {4418#true} is VALID
[2020-07-11 02:21:16,854 INFO  L280        TraceCheckUtils]: 16: Hoare triple {4418#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4418#true} is VALID
[2020-07-11 02:21:16,854 INFO  L280        TraceCheckUtils]: 17: Hoare triple {4418#true} assume 0 != #t~nondet0; {4418#true} is VALID
[2020-07-11 02:21:16,855 INFO  L280        TraceCheckUtils]: 18: Hoare triple {4418#true} havoc #t~nondet0; {4418#true} is VALID
[2020-07-11 02:21:16,855 INFO  L280        TraceCheckUtils]: 19: Hoare triple {4418#true} ~method_id~0 := 3; {4418#true} is VALID
[2020-07-11 02:21:16,855 INFO  L280        TraceCheckUtils]: 20: Hoare triple {4418#true} assume !false; {4418#true} is VALID
[2020-07-11 02:21:16,855 INFO  L280        TraceCheckUtils]: 21: Hoare triple {4418#true} ~q~0 := 2; {4418#true} is VALID
[2020-07-11 02:21:16,862 INFO  L280        TraceCheckUtils]: 22: Hoare triple {4418#true} ~this_state~0 := 0; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,863 INFO  L280        TraceCheckUtils]: 23: Hoare triple {4428#(<= main_~this_state~0 0)} assume !false; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,863 INFO  L280        TraceCheckUtils]: 24: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,867 INFO  L280        TraceCheckUtils]: 25: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(1 == ~q~0); {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,867 INFO  L280        TraceCheckUtils]: 26: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~q~0; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,868 INFO  L280        TraceCheckUtils]: 27: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,868 INFO  L280        TraceCheckUtils]: 28: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet4); {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,869 INFO  L280        TraceCheckUtils]: 29: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet4; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,870 INFO  L280        TraceCheckUtils]: 30: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,870 INFO  L280        TraceCheckUtils]: 31: Hoare triple {4428#(<= main_~this_state~0 0)} assume !(0 != #t~nondet5); {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,871 INFO  L280        TraceCheckUtils]: 32: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet5; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,871 INFO  L280        TraceCheckUtils]: 33: Hoare triple {4428#(<= main_~this_state~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,872 INFO  L280        TraceCheckUtils]: 34: Hoare triple {4428#(<= main_~this_state~0 0)} assume 0 != #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,872 INFO  L280        TraceCheckUtils]: 35: Hoare triple {4428#(<= main_~this_state~0 0)} havoc #t~nondet6; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,873 INFO  L280        TraceCheckUtils]: 36: Hoare triple {4428#(<= main_~this_state~0 0)} ~method_id~0 := 4; {4428#(<= main_~this_state~0 0)} is VALID
[2020-07-11 02:21:16,873 INFO  L280        TraceCheckUtils]: 37: Hoare triple {4428#(<= main_~this_state~0 0)} assume 2 == ~this_state~0; {4419#false} is VALID
[2020-07-11 02:21:16,874 INFO  L280        TraceCheckUtils]: 38: Hoare triple {4419#false} assume !false; {4419#false} is VALID
[2020-07-11 02:21:16,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-11 02:21:16,879 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182615695]
[2020-07-11 02:21:16,884 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:16,885 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:16,885 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887726307]
[2020-07-11 02:21:16,886 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 39
[2020-07-11 02:21:16,886 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:16,886 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:16,923 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:16,923 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:16,924 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:16,924 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:16,924 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:16,924 INFO  L87              Difference]: Start difference. First operand 163 states and 193 transitions. Second operand 4 states.
[2020-07-11 02:21:18,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:18,968 INFO  L93              Difference]: Finished difference Result 429 states and 517 transitions.
[2020-07-11 02:21:18,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:18,968 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 39
[2020-07-11 02:21:18,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:18,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:18,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions.
[2020-07-11 02:21:18,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:18,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions.
[2020-07-11 02:21:18,982 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 515 transitions.
[2020-07-11 02:21:19,599 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:19,608 INFO  L225             Difference]: With dead ends: 429
[2020-07-11 02:21:19,608 INFO  L226             Difference]: Without dead ends: 275
[2020-07-11 02:21:19,609 INFO  L675         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
[2020-07-11 02:21:19,610 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2020-07-11 02:21:20,490 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243.
[2020-07-11 02:21:20,490 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:20,490 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 243 states.
[2020-07-11 02:21:20,491 INFO  L74              IsIncluded]: Start isIncluded. First operand 275 states. Second operand 243 states.
[2020-07-11 02:21:20,491 INFO  L87              Difference]: Start difference. First operand 275 states. Second operand 243 states.
[2020-07-11 02:21:20,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:20,501 INFO  L93              Difference]: Finished difference Result 275 states and 319 transitions.
[2020-07-11 02:21:20,501 INFO  L276                IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions.
[2020-07-11 02:21:20,502 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:20,502 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:20,502 INFO  L74              IsIncluded]: Start isIncluded. First operand 243 states. Second operand 275 states.
[2020-07-11 02:21:20,502 INFO  L87              Difference]: Start difference. First operand 243 states. Second operand 275 states.
[2020-07-11 02:21:20,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:20,512 INFO  L93              Difference]: Finished difference Result 275 states and 319 transitions.
[2020-07-11 02:21:20,512 INFO  L276                IsEmpty]: Start isEmpty. Operand 275 states and 319 transitions.
[2020-07-11 02:21:20,513 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:20,513 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:20,513 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:20,513 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:20,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 243 states.
[2020-07-11 02:21:20,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions.
[2020-07-11 02:21:20,521 INFO  L78                 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 39
[2020-07-11 02:21:20,521 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:20,521 INFO  L479      AbstractCegarLoop]: Abstraction has 243 states and 288 transitions.
[2020-07-11 02:21:20,521 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:20,522 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 243 states and 288 transitions.
[2020-07-11 02:21:20,956 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:20,956 INFO  L276                IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions.
[2020-07-11 02:21:20,958 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2020-07-11 02:21:20,958 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:20,958 INFO  L422         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:20,958 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-07-11 02:21:20,959 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:20,959 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:20,959 INFO  L82        PathProgramCache]: Analyzing trace with hash -47890514, now seen corresponding path program 1 times
[2020-07-11 02:21:20,959 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:20,960 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944937564]
[2020-07-11 02:21:20,960 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:20,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:21,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:21,028 INFO  L280        TraceCheckUtils]: 0: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID
[2020-07-11 02:21:21,028 INFO  L280        TraceCheckUtils]: 1: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID
[2020-07-11 02:21:21,029 INFO  L280        TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID
[2020-07-11 02:21:21,029 INFO  L280        TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID
[2020-07-11 02:21:21,029 INFO  L280        TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID
[2020-07-11 02:21:21,029 INFO  L280        TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID
[2020-07-11 02:21:21,030 INFO  L280        TraceCheckUtils]: 6: Hoare triple {6329#true} assume true; {6329#true} is VALID
[2020-07-11 02:21:21,030 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID
[2020-07-11 02:21:21,031 INFO  L263        TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:21,031 INFO  L280        TraceCheckUtils]: 1: Hoare triple {6340#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {6329#true} is VALID
[2020-07-11 02:21:21,031 INFO  L280        TraceCheckUtils]: 2: Hoare triple {6329#true} ~m_initVerify~0 := 2; {6329#true} is VALID
[2020-07-11 02:21:21,032 INFO  L280        TraceCheckUtils]: 3: Hoare triple {6329#true} ~m_Signature~0 := 3; {6329#true} is VALID
[2020-07-11 02:21:21,032 INFO  L280        TraceCheckUtils]: 4: Hoare triple {6329#true} ~m_sign~0 := 4; {6329#true} is VALID
[2020-07-11 02:21:21,032 INFO  L280        TraceCheckUtils]: 5: Hoare triple {6329#true} ~m_verify~0 := 5; {6329#true} is VALID
[2020-07-11 02:21:21,032 INFO  L280        TraceCheckUtils]: 6: Hoare triple {6329#true} ~m_update~0 := 6; {6329#true} is VALID
[2020-07-11 02:21:21,032 INFO  L280        TraceCheckUtils]: 7: Hoare triple {6329#true} assume true; {6329#true} is VALID
[2020-07-11 02:21:21,033 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {6329#true} {6329#true} #484#return; {6329#true} is VALID
[2020-07-11 02:21:21,033 INFO  L263        TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~ret21 := main(); {6329#true} is VALID
[2020-07-11 02:21:21,033 INFO  L280        TraceCheckUtils]: 10: Hoare triple {6329#true} ~q~0 := 0; {6329#true} is VALID
[2020-07-11 02:21:21,033 INFO  L280        TraceCheckUtils]: 11: Hoare triple {6329#true} havoc ~method_id~0; {6329#true} is VALID
[2020-07-11 02:21:21,034 INFO  L280        TraceCheckUtils]: 12: Hoare triple {6329#true} ~this_state~0 := 0; {6329#true} is VALID
[2020-07-11 02:21:21,034 INFO  L280        TraceCheckUtils]: 13: Hoare triple {6329#true} goto; {6329#true} is VALID
[2020-07-11 02:21:21,034 INFO  L280        TraceCheckUtils]: 14: Hoare triple {6329#true} assume !false; {6329#true} is VALID
[2020-07-11 02:21:21,034 INFO  L280        TraceCheckUtils]: 15: Hoare triple {6329#true} assume 0 == ~q~0; {6329#true} is VALID
[2020-07-11 02:21:21,034 INFO  L280        TraceCheckUtils]: 16: Hoare triple {6329#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6329#true} is VALID
[2020-07-11 02:21:21,035 INFO  L280        TraceCheckUtils]: 17: Hoare triple {6329#true} assume 0 != #t~nondet0; {6329#true} is VALID
[2020-07-11 02:21:21,035 INFO  L280        TraceCheckUtils]: 18: Hoare triple {6329#true} havoc #t~nondet0; {6329#true} is VALID
[2020-07-11 02:21:21,035 INFO  L280        TraceCheckUtils]: 19: Hoare triple {6329#true} ~method_id~0 := 3; {6329#true} is VALID
[2020-07-11 02:21:21,035 INFO  L280        TraceCheckUtils]: 20: Hoare triple {6329#true} assume !false; {6329#true} is VALID
[2020-07-11 02:21:21,041 INFO  L280        TraceCheckUtils]: 21: Hoare triple {6329#true} ~q~0 := 2; {6339#(= 2 main_~q~0)} is VALID
[2020-07-11 02:21:21,042 INFO  L280        TraceCheckUtils]: 22: Hoare triple {6339#(= 2 main_~q~0)} ~this_state~0 := 0; {6339#(= 2 main_~q~0)} is VALID
[2020-07-11 02:21:21,042 INFO  L280        TraceCheckUtils]: 23: Hoare triple {6339#(= 2 main_~q~0)} assume !false; {6339#(= 2 main_~q~0)} is VALID
[2020-07-11 02:21:21,043 INFO  L280        TraceCheckUtils]: 24: Hoare triple {6339#(= 2 main_~q~0)} assume !(0 == ~q~0); {6339#(= 2 main_~q~0)} is VALID
[2020-07-11 02:21:21,043 INFO  L280        TraceCheckUtils]: 25: Hoare triple {6339#(= 2 main_~q~0)} assume !(1 == ~q~0); {6339#(= 2 main_~q~0)} is VALID
[2020-07-11 02:21:21,044 INFO  L280        TraceCheckUtils]: 26: Hoare triple {6339#(= 2 main_~q~0)} assume !(2 == ~q~0); {6330#false} is VALID
[2020-07-11 02:21:21,044 INFO  L280        TraceCheckUtils]: 27: Hoare triple {6330#false} assume 3 == ~q~0; {6330#false} is VALID
[2020-07-11 02:21:21,044 INFO  L280        TraceCheckUtils]: 28: Hoare triple {6330#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6330#false} is VALID
[2020-07-11 02:21:21,045 INFO  L280        TraceCheckUtils]: 29: Hoare triple {6330#false} assume !(0 != #t~nondet9); {6330#false} is VALID
[2020-07-11 02:21:21,045 INFO  L280        TraceCheckUtils]: 30: Hoare triple {6330#false} havoc #t~nondet9; {6330#false} is VALID
[2020-07-11 02:21:21,045 INFO  L280        TraceCheckUtils]: 31: Hoare triple {6330#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {6330#false} is VALID
[2020-07-11 02:21:21,045 INFO  L280        TraceCheckUtils]: 32: Hoare triple {6330#false} assume !(0 != #t~nondet10); {6330#false} is VALID
[2020-07-11 02:21:21,046 INFO  L280        TraceCheckUtils]: 33: Hoare triple {6330#false} havoc #t~nondet10; {6330#false} is VALID
[2020-07-11 02:21:21,046 INFO  L280        TraceCheckUtils]: 34: Hoare triple {6330#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {6330#false} is VALID
[2020-07-11 02:21:21,046 INFO  L280        TraceCheckUtils]: 35: Hoare triple {6330#false} assume 0 != #t~nondet11; {6330#false} is VALID
[2020-07-11 02:21:21,047 INFO  L280        TraceCheckUtils]: 36: Hoare triple {6330#false} havoc #t~nondet11; {6330#false} is VALID
[2020-07-11 02:21:21,047 INFO  L280        TraceCheckUtils]: 37: Hoare triple {6330#false} ~method_id~0 := 4; {6330#false} is VALID
[2020-07-11 02:21:21,047 INFO  L280        TraceCheckUtils]: 38: Hoare triple {6330#false} assume 2 != ~this_state~0; {6330#false} is VALID
[2020-07-11 02:21:21,047 INFO  L280        TraceCheckUtils]: 39: Hoare triple {6330#false} assume !false; {6330#false} is VALID
[2020-07-11 02:21:21,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-11 02:21:21,051 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944937564]
[2020-07-11 02:21:21,051 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:21,051 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:21,052 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750616595]
[2020-07-11 02:21:21,052 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 40
[2020-07-11 02:21:21,053 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:21,053 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:21,091 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:21,091 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:21,091 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:21,092 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:21,092 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:21,093 INFO  L87              Difference]: Start difference. First operand 243 states and 288 transitions. Second operand 4 states.
[2020-07-11 02:21:22,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:22,476 INFO  L93              Difference]: Finished difference Result 407 states and 484 transitions.
[2020-07-11 02:21:22,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:22,476 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 40
[2020-07-11 02:21:22,477 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:22,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:22,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions.
[2020-07-11 02:21:22,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:22,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions.
[2020-07-11 02:21:22,484 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 365 transitions.
[2020-07-11 02:21:22,910 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:22,914 INFO  L225             Difference]: With dead ends: 407
[2020-07-11 02:21:22,914 INFO  L226             Difference]: Without dead ends: 188
[2020-07-11 02:21:22,915 INFO  L675         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
[2020-07-11 02:21:22,915 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2020-07-11 02:21:23,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186.
[2020-07-11 02:21:23,550 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:23,550 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states.
[2020-07-11 02:21:23,551 INFO  L74              IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states.
[2020-07-11 02:21:23,551 INFO  L87              Difference]: Start difference. First operand 188 states. Second operand 186 states.
[2020-07-11 02:21:23,556 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:23,556 INFO  L93              Difference]: Finished difference Result 188 states and 219 transitions.
[2020-07-11 02:21:23,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions.
[2020-07-11 02:21:23,557 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:23,557 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:23,557 INFO  L74              IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states.
[2020-07-11 02:21:23,557 INFO  L87              Difference]: Start difference. First operand 186 states. Second operand 188 states.
[2020-07-11 02:21:23,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:23,562 INFO  L93              Difference]: Finished difference Result 188 states and 219 transitions.
[2020-07-11 02:21:23,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions.
[2020-07-11 02:21:23,563 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:23,563 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:23,563 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:23,563 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:23,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2020-07-11 02:21:23,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions.
[2020-07-11 02:21:23,568 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 40
[2020-07-11 02:21:23,568 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:23,568 INFO  L479      AbstractCegarLoop]: Abstraction has 186 states and 218 transitions.
[2020-07-11 02:21:23,568 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:23,569 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 186 states and 218 transitions.
[2020-07-11 02:21:23,871 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:23,871 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions.
[2020-07-11 02:21:23,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2020-07-11 02:21:23,872 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:23,872 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:23,873 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-07-11 02:21:23,873 INFO  L427      AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:23,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:23,873 INFO  L82        PathProgramCache]: Analyzing trace with hash 946604760, now seen corresponding path program 1 times
[2020-07-11 02:21:23,874 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:23,874 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572845251]
[2020-07-11 02:21:23,874 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:23,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:23,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:23,989 INFO  L280        TraceCheckUtils]: 0: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID
[2020-07-11 02:21:23,990 INFO  L280        TraceCheckUtils]: 1: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID
[2020-07-11 02:21:23,990 INFO  L280        TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID
[2020-07-11 02:21:23,990 INFO  L280        TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID
[2020-07-11 02:21:23,990 INFO  L280        TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID
[2020-07-11 02:21:23,991 INFO  L280        TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID
[2020-07-11 02:21:23,991 INFO  L280        TraceCheckUtils]: 6: Hoare triple {7908#true} assume true; {7908#true} is VALID
[2020-07-11 02:21:23,991 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID
[2020-07-11 02:21:24,002 INFO  L263        TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:24,003 INFO  L280        TraceCheckUtils]: 1: Hoare triple {7919#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {7908#true} is VALID
[2020-07-11 02:21:24,003 INFO  L280        TraceCheckUtils]: 2: Hoare triple {7908#true} ~m_initVerify~0 := 2; {7908#true} is VALID
[2020-07-11 02:21:24,003 INFO  L280        TraceCheckUtils]: 3: Hoare triple {7908#true} ~m_Signature~0 := 3; {7908#true} is VALID
[2020-07-11 02:21:24,004 INFO  L280        TraceCheckUtils]: 4: Hoare triple {7908#true} ~m_sign~0 := 4; {7908#true} is VALID
[2020-07-11 02:21:24,004 INFO  L280        TraceCheckUtils]: 5: Hoare triple {7908#true} ~m_verify~0 := 5; {7908#true} is VALID
[2020-07-11 02:21:24,004 INFO  L280        TraceCheckUtils]: 6: Hoare triple {7908#true} ~m_update~0 := 6; {7908#true} is VALID
[2020-07-11 02:21:24,004 INFO  L280        TraceCheckUtils]: 7: Hoare triple {7908#true} assume true; {7908#true} is VALID
[2020-07-11 02:21:24,005 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {7908#true} {7908#true} #484#return; {7908#true} is VALID
[2020-07-11 02:21:24,005 INFO  L263        TraceCheckUtils]: 9: Hoare triple {7908#true} call #t~ret21 := main(); {7908#true} is VALID
[2020-07-11 02:21:24,005 INFO  L280        TraceCheckUtils]: 10: Hoare triple {7908#true} ~q~0 := 0; {7908#true} is VALID
[2020-07-11 02:21:24,005 INFO  L280        TraceCheckUtils]: 11: Hoare triple {7908#true} havoc ~method_id~0; {7908#true} is VALID
[2020-07-11 02:21:24,006 INFO  L280        TraceCheckUtils]: 12: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID
[2020-07-11 02:21:24,006 INFO  L280        TraceCheckUtils]: 13: Hoare triple {7908#true} goto; {7908#true} is VALID
[2020-07-11 02:21:24,006 INFO  L280        TraceCheckUtils]: 14: Hoare triple {7908#true} assume !false; {7908#true} is VALID
[2020-07-11 02:21:24,006 INFO  L280        TraceCheckUtils]: 15: Hoare triple {7908#true} assume 0 == ~q~0; {7908#true} is VALID
[2020-07-11 02:21:24,007 INFO  L280        TraceCheckUtils]: 16: Hoare triple {7908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7908#true} is VALID
[2020-07-11 02:21:24,007 INFO  L280        TraceCheckUtils]: 17: Hoare triple {7908#true} assume 0 != #t~nondet0; {7908#true} is VALID
[2020-07-11 02:21:24,007 INFO  L280        TraceCheckUtils]: 18: Hoare triple {7908#true} havoc #t~nondet0; {7908#true} is VALID
[2020-07-11 02:21:24,007 INFO  L280        TraceCheckUtils]: 19: Hoare triple {7908#true} ~method_id~0 := 3; {7908#true} is VALID
[2020-07-11 02:21:24,008 INFO  L280        TraceCheckUtils]: 20: Hoare triple {7908#true} assume !false; {7908#true} is VALID
[2020-07-11 02:21:24,008 INFO  L280        TraceCheckUtils]: 21: Hoare triple {7908#true} ~q~0 := 2; {7908#true} is VALID
[2020-07-11 02:21:24,008 INFO  L280        TraceCheckUtils]: 22: Hoare triple {7908#true} ~this_state~0 := 0; {7908#true} is VALID
[2020-07-11 02:21:24,009 INFO  L280        TraceCheckUtils]: 23: Hoare triple {7908#true} assume !false; {7908#true} is VALID
[2020-07-11 02:21:24,009 INFO  L280        TraceCheckUtils]: 24: Hoare triple {7908#true} assume !(0 == ~q~0); {7908#true} is VALID
[2020-07-11 02:21:24,009 INFO  L280        TraceCheckUtils]: 25: Hoare triple {7908#true} assume !(1 == ~q~0); {7908#true} is VALID
[2020-07-11 02:21:24,010 INFO  L280        TraceCheckUtils]: 26: Hoare triple {7908#true} assume 2 == ~q~0; {7908#true} is VALID
[2020-07-11 02:21:24,010 INFO  L280        TraceCheckUtils]: 27: Hoare triple {7908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7908#true} is VALID
[2020-07-11 02:21:24,011 INFO  L280        TraceCheckUtils]: 28: Hoare triple {7908#true} assume 0 != #t~nondet4; {7908#true} is VALID
[2020-07-11 02:21:24,011 INFO  L280        TraceCheckUtils]: 29: Hoare triple {7908#true} havoc #t~nondet4; {7908#true} is VALID
[2020-07-11 02:21:24,011 INFO  L280        TraceCheckUtils]: 30: Hoare triple {7908#true} ~method_id~0 := 1; {7908#true} is VALID
[2020-07-11 02:21:24,011 INFO  L280        TraceCheckUtils]: 31: Hoare triple {7908#true} assume !false; {7908#true} is VALID
[2020-07-11 02:21:24,012 INFO  L280        TraceCheckUtils]: 32: Hoare triple {7908#true} ~q~0 := 3; {7918#(<= 3 main_~q~0)} is VALID
[2020-07-11 02:21:24,013 INFO  L280        TraceCheckUtils]: 33: Hoare triple {7918#(<= 3 main_~q~0)} ~this_state~0 := 2; {7918#(<= 3 main_~q~0)} is VALID
[2020-07-11 02:21:24,013 INFO  L280        TraceCheckUtils]: 34: Hoare triple {7918#(<= 3 main_~q~0)} assume !false; {7918#(<= 3 main_~q~0)} is VALID
[2020-07-11 02:21:24,014 INFO  L280        TraceCheckUtils]: 35: Hoare triple {7918#(<= 3 main_~q~0)} assume !(0 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID
[2020-07-11 02:21:24,015 INFO  L280        TraceCheckUtils]: 36: Hoare triple {7918#(<= 3 main_~q~0)} assume !(1 == ~q~0); {7918#(<= 3 main_~q~0)} is VALID
[2020-07-11 02:21:24,015 INFO  L280        TraceCheckUtils]: 37: Hoare triple {7918#(<= 3 main_~q~0)} assume 2 == ~q~0; {7909#false} is VALID
[2020-07-11 02:21:24,016 INFO  L280        TraceCheckUtils]: 38: Hoare triple {7909#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7909#false} is VALID
[2020-07-11 02:21:24,016 INFO  L280        TraceCheckUtils]: 39: Hoare triple {7909#false} assume !(0 != #t~nondet4); {7909#false} is VALID
[2020-07-11 02:21:24,016 INFO  L280        TraceCheckUtils]: 40: Hoare triple {7909#false} havoc #t~nondet4; {7909#false} is VALID
[2020-07-11 02:21:24,016 INFO  L280        TraceCheckUtils]: 41: Hoare triple {7909#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7909#false} is VALID
[2020-07-11 02:21:24,017 INFO  L280        TraceCheckUtils]: 42: Hoare triple {7909#false} assume !(0 != #t~nondet5); {7909#false} is VALID
[2020-07-11 02:21:24,017 INFO  L280        TraceCheckUtils]: 43: Hoare triple {7909#false} havoc #t~nondet5; {7909#false} is VALID
[2020-07-11 02:21:24,017 INFO  L280        TraceCheckUtils]: 44: Hoare triple {7909#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7909#false} is VALID
[2020-07-11 02:21:24,017 INFO  L280        TraceCheckUtils]: 45: Hoare triple {7909#false} assume 0 != #t~nondet6; {7909#false} is VALID
[2020-07-11 02:21:24,018 INFO  L280        TraceCheckUtils]: 46: Hoare triple {7909#false} havoc #t~nondet6; {7909#false} is VALID
[2020-07-11 02:21:24,018 INFO  L280        TraceCheckUtils]: 47: Hoare triple {7909#false} ~method_id~0 := 4; {7909#false} is VALID
[2020-07-11 02:21:24,018 INFO  L280        TraceCheckUtils]: 48: Hoare triple {7909#false} assume 2 == ~this_state~0; {7909#false} is VALID
[2020-07-11 02:21:24,018 INFO  L280        TraceCheckUtils]: 49: Hoare triple {7909#false} assume !false; {7909#false} is VALID
[2020-07-11 02:21:24,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:24,025 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572845251]
[2020-07-11 02:21:24,026 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:24,027 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:24,027 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312339806]
[2020-07-11 02:21:24,028 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 50
[2020-07-11 02:21:24,028 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:24,028 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:24,095 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:24,095 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:24,095 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:24,096 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:24,096 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:24,096 INFO  L87              Difference]: Start difference. First operand 186 states and 218 transitions. Second operand 4 states.
[2020-07-11 02:21:25,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:25,237 INFO  L93              Difference]: Finished difference Result 301 states and 357 transitions.
[2020-07-11 02:21:25,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:25,237 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 50
[2020-07-11 02:21:25,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:25,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:25,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions.
[2020-07-11 02:21:25,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:25,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions.
[2020-07-11 02:21:25,249 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 352 transitions.
[2020-07-11 02:21:25,649 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:25,654 INFO  L225             Difference]: With dead ends: 301
[2020-07-11 02:21:25,655 INFO  L226             Difference]: Without dead ends: 158
[2020-07-11 02:21:25,656 INFO  L675         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
[2020-07-11 02:21:25,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2020-07-11 02:21:26,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158.
[2020-07-11 02:21:26,243 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:26,243 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states.
[2020-07-11 02:21:26,244 INFO  L74              IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states.
[2020-07-11 02:21:26,244 INFO  L87              Difference]: Start difference. First operand 158 states. Second operand 158 states.
[2020-07-11 02:21:26,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:26,247 INFO  L93              Difference]: Finished difference Result 158 states and 184 transitions.
[2020-07-11 02:21:26,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions.
[2020-07-11 02:21:26,248 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:26,248 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:26,248 INFO  L74              IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states.
[2020-07-11 02:21:26,249 INFO  L87              Difference]: Start difference. First operand 158 states. Second operand 158 states.
[2020-07-11 02:21:26,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:26,252 INFO  L93              Difference]: Finished difference Result 158 states and 184 transitions.
[2020-07-11 02:21:26,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions.
[2020-07-11 02:21:26,253 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:26,253 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:26,253 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:26,253 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:26,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 158 states.
[2020-07-11 02:21:26,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions.
[2020-07-11 02:21:26,257 INFO  L78                 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 50
[2020-07-11 02:21:26,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:26,257 INFO  L479      AbstractCegarLoop]: Abstraction has 158 states and 184 transitions.
[2020-07-11 02:21:26,257 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:26,257 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 184 transitions.
[2020-07-11 02:21:26,515 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:26,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions.
[2020-07-11 02:21:26,516 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2020-07-11 02:21:26,516 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:26,517 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:26,517 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-07-11 02:21:26,517 INFO  L427      AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:26,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:26,518 INFO  L82        PathProgramCache]: Analyzing trace with hash -1459500481, now seen corresponding path program 1 times
[2020-07-11 02:21:26,518 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:26,518 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384396195]
[2020-07-11 02:21:26,518 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:26,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:26,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:26,610 INFO  L280        TraceCheckUtils]: 0: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID
[2020-07-11 02:21:26,611 INFO  L280        TraceCheckUtils]: 1: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID
[2020-07-11 02:21:26,611 INFO  L280        TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID
[2020-07-11 02:21:26,611 INFO  L280        TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID
[2020-07-11 02:21:26,612 INFO  L280        TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID
[2020-07-11 02:21:26,612 INFO  L280        TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID
[2020-07-11 02:21:26,612 INFO  L280        TraceCheckUtils]: 6: Hoare triple {9159#true} assume true; {9159#true} is VALID
[2020-07-11 02:21:26,612 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID
[2020-07-11 02:21:26,613 INFO  L263        TraceCheckUtils]: 0: Hoare triple {9159#true} call ULTIMATE.init(); {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:26,614 INFO  L280        TraceCheckUtils]: 1: Hoare triple {9170#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {9159#true} is VALID
[2020-07-11 02:21:26,614 INFO  L280        TraceCheckUtils]: 2: Hoare triple {9159#true} ~m_initVerify~0 := 2; {9159#true} is VALID
[2020-07-11 02:21:26,614 INFO  L280        TraceCheckUtils]: 3: Hoare triple {9159#true} ~m_Signature~0 := 3; {9159#true} is VALID
[2020-07-11 02:21:26,615 INFO  L280        TraceCheckUtils]: 4: Hoare triple {9159#true} ~m_sign~0 := 4; {9159#true} is VALID
[2020-07-11 02:21:26,615 INFO  L280        TraceCheckUtils]: 5: Hoare triple {9159#true} ~m_verify~0 := 5; {9159#true} is VALID
[2020-07-11 02:21:26,615 INFO  L280        TraceCheckUtils]: 6: Hoare triple {9159#true} ~m_update~0 := 6; {9159#true} is VALID
[2020-07-11 02:21:26,616 INFO  L280        TraceCheckUtils]: 7: Hoare triple {9159#true} assume true; {9159#true} is VALID
[2020-07-11 02:21:26,616 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {9159#true} {9159#true} #484#return; {9159#true} is VALID
[2020-07-11 02:21:26,616 INFO  L263        TraceCheckUtils]: 9: Hoare triple {9159#true} call #t~ret21 := main(); {9159#true} is VALID
[2020-07-11 02:21:26,617 INFO  L280        TraceCheckUtils]: 10: Hoare triple {9159#true} ~q~0 := 0; {9159#true} is VALID
[2020-07-11 02:21:26,617 INFO  L280        TraceCheckUtils]: 11: Hoare triple {9159#true} havoc ~method_id~0; {9159#true} is VALID
[2020-07-11 02:21:26,617 INFO  L280        TraceCheckUtils]: 12: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID
[2020-07-11 02:21:26,617 INFO  L280        TraceCheckUtils]: 13: Hoare triple {9159#true} goto; {9159#true} is VALID
[2020-07-11 02:21:26,618 INFO  L280        TraceCheckUtils]: 14: Hoare triple {9159#true} assume !false; {9159#true} is VALID
[2020-07-11 02:21:26,618 INFO  L280        TraceCheckUtils]: 15: Hoare triple {9159#true} assume 0 == ~q~0; {9159#true} is VALID
[2020-07-11 02:21:26,618 INFO  L280        TraceCheckUtils]: 16: Hoare triple {9159#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9159#true} is VALID
[2020-07-11 02:21:26,618 INFO  L280        TraceCheckUtils]: 17: Hoare triple {9159#true} assume 0 != #t~nondet0; {9159#true} is VALID
[2020-07-11 02:21:26,619 INFO  L280        TraceCheckUtils]: 18: Hoare triple {9159#true} havoc #t~nondet0; {9159#true} is VALID
[2020-07-11 02:21:26,619 INFO  L280        TraceCheckUtils]: 19: Hoare triple {9159#true} ~method_id~0 := 3; {9159#true} is VALID
[2020-07-11 02:21:26,619 INFO  L280        TraceCheckUtils]: 20: Hoare triple {9159#true} assume !false; {9159#true} is VALID
[2020-07-11 02:21:26,620 INFO  L280        TraceCheckUtils]: 21: Hoare triple {9159#true} ~q~0 := 2; {9159#true} is VALID
[2020-07-11 02:21:26,620 INFO  L280        TraceCheckUtils]: 22: Hoare triple {9159#true} ~this_state~0 := 0; {9159#true} is VALID
[2020-07-11 02:21:26,620 INFO  L280        TraceCheckUtils]: 23: Hoare triple {9159#true} assume !false; {9159#true} is VALID
[2020-07-11 02:21:26,620 INFO  L280        TraceCheckUtils]: 24: Hoare triple {9159#true} assume !(0 == ~q~0); {9159#true} is VALID
[2020-07-11 02:21:26,621 INFO  L280        TraceCheckUtils]: 25: Hoare triple {9159#true} assume !(1 == ~q~0); {9159#true} is VALID
[2020-07-11 02:21:26,621 INFO  L280        TraceCheckUtils]: 26: Hoare triple {9159#true} assume 2 == ~q~0; {9159#true} is VALID
[2020-07-11 02:21:26,621 INFO  L280        TraceCheckUtils]: 27: Hoare triple {9159#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9159#true} is VALID
[2020-07-11 02:21:26,622 INFO  L280        TraceCheckUtils]: 28: Hoare triple {9159#true} assume 0 != #t~nondet4; {9159#true} is VALID
[2020-07-11 02:21:26,622 INFO  L280        TraceCheckUtils]: 29: Hoare triple {9159#true} havoc #t~nondet4; {9159#true} is VALID
[2020-07-11 02:21:26,622 INFO  L280        TraceCheckUtils]: 30: Hoare triple {9159#true} ~method_id~0 := 1; {9159#true} is VALID
[2020-07-11 02:21:26,622 INFO  L280        TraceCheckUtils]: 31: Hoare triple {9159#true} assume !false; {9159#true} is VALID
[2020-07-11 02:21:26,623 INFO  L280        TraceCheckUtils]: 32: Hoare triple {9159#true} ~q~0 := 3; {9159#true} is VALID
[2020-07-11 02:21:26,624 INFO  L280        TraceCheckUtils]: 33: Hoare triple {9159#true} ~this_state~0 := 2; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,624 INFO  L280        TraceCheckUtils]: 34: Hoare triple {9169#(= 2 main_~this_state~0)} assume !false; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,625 INFO  L280        TraceCheckUtils]: 35: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,626 INFO  L280        TraceCheckUtils]: 36: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(1 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,627 INFO  L280        TraceCheckUtils]: 37: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(2 == ~q~0); {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,627 INFO  L280        TraceCheckUtils]: 38: Hoare triple {9169#(= 2 main_~this_state~0)} assume 3 == ~q~0; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,628 INFO  L280        TraceCheckUtils]: 39: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,629 INFO  L280        TraceCheckUtils]: 40: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet9); {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,630 INFO  L280        TraceCheckUtils]: 41: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet9; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,630 INFO  L280        TraceCheckUtils]: 42: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,631 INFO  L280        TraceCheckUtils]: 43: Hoare triple {9169#(= 2 main_~this_state~0)} assume !(0 != #t~nondet10); {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,631 INFO  L280        TraceCheckUtils]: 44: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet10; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,632 INFO  L280        TraceCheckUtils]: 45: Hoare triple {9169#(= 2 main_~this_state~0)} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,632 INFO  L280        TraceCheckUtils]: 46: Hoare triple {9169#(= 2 main_~this_state~0)} assume 0 != #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,633 INFO  L280        TraceCheckUtils]: 47: Hoare triple {9169#(= 2 main_~this_state~0)} havoc #t~nondet11; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,634 INFO  L280        TraceCheckUtils]: 48: Hoare triple {9169#(= 2 main_~this_state~0)} ~method_id~0 := 4; {9169#(= 2 main_~this_state~0)} is VALID
[2020-07-11 02:21:26,634 INFO  L280        TraceCheckUtils]: 49: Hoare triple {9169#(= 2 main_~this_state~0)} assume 2 != ~this_state~0; {9160#false} is VALID
[2020-07-11 02:21:26,634 INFO  L280        TraceCheckUtils]: 50: Hoare triple {9160#false} assume !false; {9160#false} is VALID
[2020-07-11 02:21:26,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:26,637 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384396195]
[2020-07-11 02:21:26,637 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:26,637 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:26,638 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887320588]
[2020-07-11 02:21:26,638 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 51
[2020-07-11 02:21:26,639 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:26,639 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:26,689 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:26,690 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:26,690 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:26,690 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:26,690 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:26,691 INFO  L87              Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 4 states.
[2020-07-11 02:21:28,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:28,508 INFO  L93              Difference]: Finished difference Result 356 states and 426 transitions.
[2020-07-11 02:21:28,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:28,508 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 51
[2020-07-11 02:21:28,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:28,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:28,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions.
[2020-07-11 02:21:28,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:28,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions.
[2020-07-11 02:21:28,515 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 421 transitions.
[2020-07-11 02:21:29,040 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:29,046 INFO  L225             Difference]: With dead ends: 356
[2020-07-11 02:21:29,046 INFO  L226             Difference]: Without dead ends: 248
[2020-07-11 02:21:29,047 INFO  L675         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
[2020-07-11 02:21:29,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2020-07-11 02:21:29,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 223.
[2020-07-11 02:21:29,993 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:29,993 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 223 states.
[2020-07-11 02:21:29,993 INFO  L74              IsIncluded]: Start isIncluded. First operand 248 states. Second operand 223 states.
[2020-07-11 02:21:29,993 INFO  L87              Difference]: Start difference. First operand 248 states. Second operand 223 states.
[2020-07-11 02:21:30,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:30,002 INFO  L93              Difference]: Finished difference Result 248 states and 286 transitions.
[2020-07-11 02:21:30,002 INFO  L276                IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions.
[2020-07-11 02:21:30,003 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:30,003 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:30,003 INFO  L74              IsIncluded]: Start isIncluded. First operand 223 states. Second operand 248 states.
[2020-07-11 02:21:30,003 INFO  L87              Difference]: Start difference. First operand 223 states. Second operand 248 states.
[2020-07-11 02:21:30,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:30,011 INFO  L93              Difference]: Finished difference Result 248 states and 286 transitions.
[2020-07-11 02:21:30,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions.
[2020-07-11 02:21:30,011 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:30,012 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:30,012 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:30,012 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:30,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 223 states.
[2020-07-11 02:21:30,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions.
[2020-07-11 02:21:30,017 INFO  L78                 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 51
[2020-07-11 02:21:30,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:30,018 INFO  L479      AbstractCegarLoop]: Abstraction has 223 states and 262 transitions.
[2020-07-11 02:21:30,018 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:30,018 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 262 transitions.
[2020-07-11 02:21:30,415 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:30,416 INFO  L276                IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions.
[2020-07-11 02:21:30,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2020-07-11 02:21:30,417 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:30,417 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:30,417 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-07-11 02:21:30,418 INFO  L427      AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:30,418 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:30,418 INFO  L82        PathProgramCache]: Analyzing trace with hash -389028907, now seen corresponding path program 1 times
[2020-07-11 02:21:30,418 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:30,418 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1986904112]
[2020-07-11 02:21:30,419 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:30,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:30,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:30,483 INFO  L280        TraceCheckUtils]: 0: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID
[2020-07-11 02:21:30,484 INFO  L280        TraceCheckUtils]: 1: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID
[2020-07-11 02:21:30,484 INFO  L280        TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID
[2020-07-11 02:21:30,484 INFO  L280        TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID
[2020-07-11 02:21:30,485 INFO  L280        TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID
[2020-07-11 02:21:30,486 INFO  L280        TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID
[2020-07-11 02:21:30,486 INFO  L280        TraceCheckUtils]: 6: Hoare triple {10830#true} assume true; {10830#true} is VALID
[2020-07-11 02:21:30,486 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID
[2020-07-11 02:21:30,488 INFO  L263        TraceCheckUtils]: 0: Hoare triple {10830#true} call ULTIMATE.init(); {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:30,488 INFO  L280        TraceCheckUtils]: 1: Hoare triple {10841#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {10830#true} is VALID
[2020-07-11 02:21:30,488 INFO  L280        TraceCheckUtils]: 2: Hoare triple {10830#true} ~m_initVerify~0 := 2; {10830#true} is VALID
[2020-07-11 02:21:30,488 INFO  L280        TraceCheckUtils]: 3: Hoare triple {10830#true} ~m_Signature~0 := 3; {10830#true} is VALID
[2020-07-11 02:21:30,489 INFO  L280        TraceCheckUtils]: 4: Hoare triple {10830#true} ~m_sign~0 := 4; {10830#true} is VALID
[2020-07-11 02:21:30,489 INFO  L280        TraceCheckUtils]: 5: Hoare triple {10830#true} ~m_verify~0 := 5; {10830#true} is VALID
[2020-07-11 02:21:30,489 INFO  L280        TraceCheckUtils]: 6: Hoare triple {10830#true} ~m_update~0 := 6; {10830#true} is VALID
[2020-07-11 02:21:30,489 INFO  L280        TraceCheckUtils]: 7: Hoare triple {10830#true} assume true; {10830#true} is VALID
[2020-07-11 02:21:30,490 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {10830#true} {10830#true} #484#return; {10830#true} is VALID
[2020-07-11 02:21:30,490 INFO  L263        TraceCheckUtils]: 9: Hoare triple {10830#true} call #t~ret21 := main(); {10830#true} is VALID
[2020-07-11 02:21:30,490 INFO  L280        TraceCheckUtils]: 10: Hoare triple {10830#true} ~q~0 := 0; {10830#true} is VALID
[2020-07-11 02:21:30,490 INFO  L280        TraceCheckUtils]: 11: Hoare triple {10830#true} havoc ~method_id~0; {10830#true} is VALID
[2020-07-11 02:21:30,490 INFO  L280        TraceCheckUtils]: 12: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID
[2020-07-11 02:21:30,491 INFO  L280        TraceCheckUtils]: 13: Hoare triple {10830#true} goto; {10830#true} is VALID
[2020-07-11 02:21:30,491 INFO  L280        TraceCheckUtils]: 14: Hoare triple {10830#true} assume !false; {10830#true} is VALID
[2020-07-11 02:21:30,491 INFO  L280        TraceCheckUtils]: 15: Hoare triple {10830#true} assume 0 == ~q~0; {10830#true} is VALID
[2020-07-11 02:21:30,496 INFO  L280        TraceCheckUtils]: 16: Hoare triple {10830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10830#true} is VALID
[2020-07-11 02:21:30,497 INFO  L280        TraceCheckUtils]: 17: Hoare triple {10830#true} assume 0 != #t~nondet0; {10830#true} is VALID
[2020-07-11 02:21:30,497 INFO  L280        TraceCheckUtils]: 18: Hoare triple {10830#true} havoc #t~nondet0; {10830#true} is VALID
[2020-07-11 02:21:30,497 INFO  L280        TraceCheckUtils]: 19: Hoare triple {10830#true} ~method_id~0 := 3; {10830#true} is VALID
[2020-07-11 02:21:30,497 INFO  L280        TraceCheckUtils]: 20: Hoare triple {10830#true} assume !false; {10830#true} is VALID
[2020-07-11 02:21:30,497 INFO  L280        TraceCheckUtils]: 21: Hoare triple {10830#true} ~q~0 := 2; {10830#true} is VALID
[2020-07-11 02:21:30,498 INFO  L280        TraceCheckUtils]: 22: Hoare triple {10830#true} ~this_state~0 := 0; {10830#true} is VALID
[2020-07-11 02:21:30,498 INFO  L280        TraceCheckUtils]: 23: Hoare triple {10830#true} assume !false; {10830#true} is VALID
[2020-07-11 02:21:30,498 INFO  L280        TraceCheckUtils]: 24: Hoare triple {10830#true} assume !(0 == ~q~0); {10830#true} is VALID
[2020-07-11 02:21:30,498 INFO  L280        TraceCheckUtils]: 25: Hoare triple {10830#true} assume !(1 == ~q~0); {10830#true} is VALID
[2020-07-11 02:21:30,498 INFO  L280        TraceCheckUtils]: 26: Hoare triple {10830#true} assume 2 == ~q~0; {10830#true} is VALID
[2020-07-11 02:21:30,499 INFO  L280        TraceCheckUtils]: 27: Hoare triple {10830#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10830#true} is VALID
[2020-07-11 02:21:30,499 INFO  L280        TraceCheckUtils]: 28: Hoare triple {10830#true} assume 0 != #t~nondet4; {10830#true} is VALID
[2020-07-11 02:21:30,499 INFO  L280        TraceCheckUtils]: 29: Hoare triple {10830#true} havoc #t~nondet4; {10830#true} is VALID
[2020-07-11 02:21:30,500 INFO  L280        TraceCheckUtils]: 30: Hoare triple {10830#true} ~method_id~0 := 1; {10830#true} is VALID
[2020-07-11 02:21:30,501 INFO  L280        TraceCheckUtils]: 31: Hoare triple {10830#true} assume !false; {10830#true} is VALID
[2020-07-11 02:21:30,505 INFO  L280        TraceCheckUtils]: 32: Hoare triple {10830#true} ~q~0 := 3; {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,505 INFO  L280        TraceCheckUtils]: 33: Hoare triple {10840#(= 3 main_~q~0)} ~this_state~0 := 2; {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,506 INFO  L280        TraceCheckUtils]: 34: Hoare triple {10840#(= 3 main_~q~0)} assume !false; {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,506 INFO  L280        TraceCheckUtils]: 35: Hoare triple {10840#(= 3 main_~q~0)} assume !(0 == ~q~0); {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,507 INFO  L280        TraceCheckUtils]: 36: Hoare triple {10840#(= 3 main_~q~0)} assume !(1 == ~q~0); {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,508 INFO  L280        TraceCheckUtils]: 37: Hoare triple {10840#(= 3 main_~q~0)} assume !(2 == ~q~0); {10840#(= 3 main_~q~0)} is VALID
[2020-07-11 02:21:30,508 INFO  L280        TraceCheckUtils]: 38: Hoare triple {10840#(= 3 main_~q~0)} assume !(3 == ~q~0); {10831#false} is VALID
[2020-07-11 02:21:30,509 INFO  L280        TraceCheckUtils]: 39: Hoare triple {10831#false} assume 4 == ~q~0; {10831#false} is VALID
[2020-07-11 02:21:30,509 INFO  L280        TraceCheckUtils]: 40: Hoare triple {10831#false} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {10831#false} is VALID
[2020-07-11 02:21:30,509 INFO  L280        TraceCheckUtils]: 41: Hoare triple {10831#false} assume !(0 != #t~nondet15); {10831#false} is VALID
[2020-07-11 02:21:30,509 INFO  L280        TraceCheckUtils]: 42: Hoare triple {10831#false} havoc #t~nondet15; {10831#false} is VALID
[2020-07-11 02:21:30,510 INFO  L280        TraceCheckUtils]: 43: Hoare triple {10831#false} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {10831#false} is VALID
[2020-07-11 02:21:30,510 INFO  L280        TraceCheckUtils]: 44: Hoare triple {10831#false} assume !(0 != #t~nondet16); {10831#false} is VALID
[2020-07-11 02:21:30,510 INFO  L280        TraceCheckUtils]: 45: Hoare triple {10831#false} havoc #t~nondet16; {10831#false} is VALID
[2020-07-11 02:21:30,510 INFO  L280        TraceCheckUtils]: 46: Hoare triple {10831#false} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {10831#false} is VALID
[2020-07-11 02:21:30,510 INFO  L280        TraceCheckUtils]: 47: Hoare triple {10831#false} assume 0 != #t~nondet17; {10831#false} is VALID
[2020-07-11 02:21:30,511 INFO  L280        TraceCheckUtils]: 48: Hoare triple {10831#false} havoc #t~nondet17; {10831#false} is VALID
[2020-07-11 02:21:30,511 INFO  L280        TraceCheckUtils]: 49: Hoare triple {10831#false} ~method_id~0 := 4; {10831#false} is VALID
[2020-07-11 02:21:30,511 INFO  L280        TraceCheckUtils]: 50: Hoare triple {10831#false} assume 2 == ~this_state~0; {10831#false} is VALID
[2020-07-11 02:21:30,511 INFO  L280        TraceCheckUtils]: 51: Hoare triple {10831#false} assume !false; {10831#false} is VALID
[2020-07-11 02:21:30,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:30,514 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1986904112]
[2020-07-11 02:21:30,515 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:30,515 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:30,515 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007755083]
[2020-07-11 02:21:30,516 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 52
[2020-07-11 02:21:30,516 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:30,516 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:30,563 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:30,563 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:30,563 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:30,564 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:30,564 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:30,564 INFO  L87              Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 4 states.
[2020-07-11 02:21:31,977 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:31,977 INFO  L93              Difference]: Finished difference Result 369 states and 437 transitions.
[2020-07-11 02:21:31,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:31,978 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 52
[2020-07-11 02:21:31,978 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:31,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:31,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions.
[2020-07-11 02:21:31,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:31,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions.
[2020-07-11 02:21:31,985 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 314 transitions.
[2020-07-11 02:21:32,373 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:32,377 INFO  L225             Difference]: With dead ends: 369
[2020-07-11 02:21:32,377 INFO  L226             Difference]: Without dead ends: 199
[2020-07-11 02:21:32,378 INFO  L675         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
[2020-07-11 02:21:32,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2020-07-11 02:21:33,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197.
[2020-07-11 02:21:33,133 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:33,133 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 197 states.
[2020-07-11 02:21:33,134 INFO  L74              IsIncluded]: Start isIncluded. First operand 199 states. Second operand 197 states.
[2020-07-11 02:21:33,134 INFO  L87              Difference]: Start difference. First operand 199 states. Second operand 197 states.
[2020-07-11 02:21:33,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:33,139 INFO  L93              Difference]: Finished difference Result 199 states and 229 transitions.
[2020-07-11 02:21:33,139 INFO  L276                IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions.
[2020-07-11 02:21:33,140 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:33,140 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:33,140 INFO  L74              IsIncluded]: Start isIncluded. First operand 197 states. Second operand 199 states.
[2020-07-11 02:21:33,140 INFO  L87              Difference]: Start difference. First operand 197 states. Second operand 199 states.
[2020-07-11 02:21:33,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:33,145 INFO  L93              Difference]: Finished difference Result 199 states and 229 transitions.
[2020-07-11 02:21:33,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions.
[2020-07-11 02:21:33,145 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:33,146 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:33,146 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:33,146 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:33,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 197 states.
[2020-07-11 02:21:33,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions.
[2020-07-11 02:21:33,150 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 52
[2020-07-11 02:21:33,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:33,150 INFO  L479      AbstractCegarLoop]: Abstraction has 197 states and 228 transitions.
[2020-07-11 02:21:33,150 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:33,150 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 197 states and 228 transitions.
[2020-07-11 02:21:33,498 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:33,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions.
[2020-07-11 02:21:33,499 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2020-07-11 02:21:33,499 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:33,499 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:33,499 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-07-11 02:21:33,500 INFO  L427      AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:33,500 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:33,500 INFO  L82        PathProgramCache]: Analyzing trace with hash 910217494, now seen corresponding path program 1 times
[2020-07-11 02:21:33,500 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:33,501 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596951808]
[2020-07-11 02:21:33,501 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:33,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:33,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:33,565 INFO  L280        TraceCheckUtils]: 0: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID
[2020-07-11 02:21:33,565 INFO  L280        TraceCheckUtils]: 1: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID
[2020-07-11 02:21:33,566 INFO  L280        TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID
[2020-07-11 02:21:33,566 INFO  L280        TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID
[2020-07-11 02:21:33,566 INFO  L280        TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID
[2020-07-11 02:21:33,566 INFO  L280        TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID
[2020-07-11 02:21:33,566 INFO  L280        TraceCheckUtils]: 6: Hoare triple {12377#true} assume true; {12377#true} is VALID
[2020-07-11 02:21:33,567 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID
[2020-07-11 02:21:33,570 INFO  L263        TraceCheckUtils]: 0: Hoare triple {12377#true} call ULTIMATE.init(); {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:33,570 INFO  L280        TraceCheckUtils]: 1: Hoare triple {12388#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {12377#true} is VALID
[2020-07-11 02:21:33,571 INFO  L280        TraceCheckUtils]: 2: Hoare triple {12377#true} ~m_initVerify~0 := 2; {12377#true} is VALID
[2020-07-11 02:21:33,571 INFO  L280        TraceCheckUtils]: 3: Hoare triple {12377#true} ~m_Signature~0 := 3; {12377#true} is VALID
[2020-07-11 02:21:33,571 INFO  L280        TraceCheckUtils]: 4: Hoare triple {12377#true} ~m_sign~0 := 4; {12377#true} is VALID
[2020-07-11 02:21:33,571 INFO  L280        TraceCheckUtils]: 5: Hoare triple {12377#true} ~m_verify~0 := 5; {12377#true} is VALID
[2020-07-11 02:21:33,573 INFO  L280        TraceCheckUtils]: 6: Hoare triple {12377#true} ~m_update~0 := 6; {12377#true} is VALID
[2020-07-11 02:21:33,574 INFO  L280        TraceCheckUtils]: 7: Hoare triple {12377#true} assume true; {12377#true} is VALID
[2020-07-11 02:21:33,574 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {12377#true} {12377#true} #484#return; {12377#true} is VALID
[2020-07-11 02:21:33,574 INFO  L263        TraceCheckUtils]: 9: Hoare triple {12377#true} call #t~ret21 := main(); {12377#true} is VALID
[2020-07-11 02:21:33,574 INFO  L280        TraceCheckUtils]: 10: Hoare triple {12377#true} ~q~0 := 0; {12377#true} is VALID
[2020-07-11 02:21:33,575 INFO  L280        TraceCheckUtils]: 11: Hoare triple {12377#true} havoc ~method_id~0; {12377#true} is VALID
[2020-07-11 02:21:33,575 INFO  L280        TraceCheckUtils]: 12: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID
[2020-07-11 02:21:33,576 INFO  L280        TraceCheckUtils]: 13: Hoare triple {12377#true} goto; {12377#true} is VALID
[2020-07-11 02:21:33,576 INFO  L280        TraceCheckUtils]: 14: Hoare triple {12377#true} assume !false; {12377#true} is VALID
[2020-07-11 02:21:33,576 INFO  L280        TraceCheckUtils]: 15: Hoare triple {12377#true} assume 0 == ~q~0; {12377#true} is VALID
[2020-07-11 02:21:33,576 INFO  L280        TraceCheckUtils]: 16: Hoare triple {12377#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12377#true} is VALID
[2020-07-11 02:21:33,576 INFO  L280        TraceCheckUtils]: 17: Hoare triple {12377#true} assume 0 != #t~nondet0; {12377#true} is VALID
[2020-07-11 02:21:33,577 INFO  L280        TraceCheckUtils]: 18: Hoare triple {12377#true} havoc #t~nondet0; {12377#true} is VALID
[2020-07-11 02:21:33,577 INFO  L280        TraceCheckUtils]: 19: Hoare triple {12377#true} ~method_id~0 := 3; {12377#true} is VALID
[2020-07-11 02:21:33,577 INFO  L280        TraceCheckUtils]: 20: Hoare triple {12377#true} assume !false; {12377#true} is VALID
[2020-07-11 02:21:33,578 INFO  L280        TraceCheckUtils]: 21: Hoare triple {12377#true} ~q~0 := 2; {12377#true} is VALID
[2020-07-11 02:21:33,578 INFO  L280        TraceCheckUtils]: 22: Hoare triple {12377#true} ~this_state~0 := 0; {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 23: Hoare triple {12377#true} assume !false; {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 24: Hoare triple {12377#true} assume !(0 == ~q~0); {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 25: Hoare triple {12377#true} assume !(1 == ~q~0); {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 26: Hoare triple {12377#true} assume 2 == ~q~0; {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 27: Hoare triple {12377#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12377#true} is VALID
[2020-07-11 02:21:33,579 INFO  L280        TraceCheckUtils]: 28: Hoare triple {12377#true} assume !(0 != #t~nondet4); {12377#true} is VALID
[2020-07-11 02:21:33,580 INFO  L280        TraceCheckUtils]: 29: Hoare triple {12377#true} havoc #t~nondet4; {12377#true} is VALID
[2020-07-11 02:21:33,580 INFO  L280        TraceCheckUtils]: 30: Hoare triple {12377#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12377#true} is VALID
[2020-07-11 02:21:33,580 INFO  L280        TraceCheckUtils]: 31: Hoare triple {12377#true} assume 0 != #t~nondet5; {12377#true} is VALID
[2020-07-11 02:21:33,580 INFO  L280        TraceCheckUtils]: 32: Hoare triple {12377#true} havoc #t~nondet5; {12377#true} is VALID
[2020-07-11 02:21:33,580 INFO  L280        TraceCheckUtils]: 33: Hoare triple {12377#true} ~method_id~0 := 2; {12377#true} is VALID
[2020-07-11 02:21:33,581 INFO  L280        TraceCheckUtils]: 34: Hoare triple {12377#true} assume !false; {12377#true} is VALID
[2020-07-11 02:21:33,583 INFO  L280        TraceCheckUtils]: 35: Hoare triple {12377#true} ~q~0 := 4; {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,584 INFO  L280        TraceCheckUtils]: 36: Hoare triple {12387#(<= 4 main_~q~0)} ~this_state~0 := 3; {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,584 INFO  L280        TraceCheckUtils]: 37: Hoare triple {12387#(<= 4 main_~q~0)} assume !false; {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,585 INFO  L280        TraceCheckUtils]: 38: Hoare triple {12387#(<= 4 main_~q~0)} assume !(0 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,585 INFO  L280        TraceCheckUtils]: 39: Hoare triple {12387#(<= 4 main_~q~0)} assume !(1 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,586 INFO  L280        TraceCheckUtils]: 40: Hoare triple {12387#(<= 4 main_~q~0)} assume !(2 == ~q~0); {12387#(<= 4 main_~q~0)} is VALID
[2020-07-11 02:21:33,587 INFO  L280        TraceCheckUtils]: 41: Hoare triple {12387#(<= 4 main_~q~0)} assume 3 == ~q~0; {12378#false} is VALID
[2020-07-11 02:21:33,587 INFO  L280        TraceCheckUtils]: 42: Hoare triple {12378#false} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {12378#false} is VALID
[2020-07-11 02:21:33,587 INFO  L280        TraceCheckUtils]: 43: Hoare triple {12378#false} assume !(0 != #t~nondet9); {12378#false} is VALID
[2020-07-11 02:21:33,587 INFO  L280        TraceCheckUtils]: 44: Hoare triple {12378#false} havoc #t~nondet9; {12378#false} is VALID
[2020-07-11 02:21:33,587 INFO  L280        TraceCheckUtils]: 45: Hoare triple {12378#false} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 46: Hoare triple {12378#false} assume !(0 != #t~nondet10); {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 47: Hoare triple {12378#false} havoc #t~nondet10; {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 48: Hoare triple {12378#false} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 49: Hoare triple {12378#false} assume 0 != #t~nondet11; {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 50: Hoare triple {12378#false} havoc #t~nondet11; {12378#false} is VALID
[2020-07-11 02:21:33,588 INFO  L280        TraceCheckUtils]: 51: Hoare triple {12378#false} ~method_id~0 := 4; {12378#false} is VALID
[2020-07-11 02:21:33,589 INFO  L280        TraceCheckUtils]: 52: Hoare triple {12378#false} assume 2 != ~this_state~0; {12378#false} is VALID
[2020-07-11 02:21:33,589 INFO  L280        TraceCheckUtils]: 53: Hoare triple {12378#false} assume !false; {12378#false} is VALID
[2020-07-11 02:21:33,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:33,591 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596951808]
[2020-07-11 02:21:33,592 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:33,592 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:33,594 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316711983]
[2020-07-11 02:21:33,595 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 54
[2020-07-11 02:21:33,597 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:33,597 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:33,644 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:33,644 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:33,645 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:33,645 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:33,645 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:33,646 INFO  L87              Difference]: Start difference. First operand 197 states and 228 transitions. Second operand 4 states.
[2020-07-11 02:21:34,930 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:34,930 INFO  L93              Difference]: Finished difference Result 300 states and 348 transitions.
[2020-07-11 02:21:34,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:34,931 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 54
[2020-07-11 02:21:34,931 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:34,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:34,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions.
[2020-07-11 02:21:34,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:34,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions.
[2020-07-11 02:21:34,935 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 300 transitions.
[2020-07-11 02:21:35,280 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:35,284 INFO  L225             Difference]: With dead ends: 300
[2020-07-11 02:21:35,284 INFO  L226             Difference]: Without dead ends: 156
[2020-07-11 02:21:35,285 INFO  L675         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
[2020-07-11 02:21:35,286 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2020-07-11 02:21:35,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156.
[2020-07-11 02:21:35,967 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:35,967 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states.
[2020-07-11 02:21:35,968 INFO  L74              IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states.
[2020-07-11 02:21:35,968 INFO  L87              Difference]: Start difference. First operand 156 states. Second operand 156 states.
[2020-07-11 02:21:35,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:35,972 INFO  L93              Difference]: Finished difference Result 156 states and 175 transitions.
[2020-07-11 02:21:35,972 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions.
[2020-07-11 02:21:35,973 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:35,973 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:35,973 INFO  L74              IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states.
[2020-07-11 02:21:35,973 INFO  L87              Difference]: Start difference. First operand 156 states. Second operand 156 states.
[2020-07-11 02:21:35,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:35,976 INFO  L93              Difference]: Finished difference Result 156 states and 175 transitions.
[2020-07-11 02:21:35,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions.
[2020-07-11 02:21:35,977 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:35,977 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:35,977 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:35,977 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:35,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2020-07-11 02:21:35,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions.
[2020-07-11 02:21:35,980 INFO  L78                 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 54
[2020-07-11 02:21:35,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:35,981 INFO  L479      AbstractCegarLoop]: Abstraction has 156 states and 175 transitions.
[2020-07-11 02:21:35,981 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:35,981 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 175 transitions.
[2020-07-11 02:21:36,251 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:36,251 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions.
[2020-07-11 02:21:36,252 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2020-07-11 02:21:36,252 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:36,253 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:36,253 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-07-11 02:21:36,253 INFO  L427      AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:36,254 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:36,254 INFO  L82        PathProgramCache]: Analyzing trace with hash 57784286, now seen corresponding path program 1 times
[2020-07-11 02:21:36,254 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:36,254 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949029616]
[2020-07-11 02:21:36,254 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:36,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:36,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:36,351 INFO  L280        TraceCheckUtils]: 0: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID
[2020-07-11 02:21:36,351 INFO  L280        TraceCheckUtils]: 1: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID
[2020-07-11 02:21:36,351 INFO  L280        TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID
[2020-07-11 02:21:36,352 INFO  L280        TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID
[2020-07-11 02:21:36,352 INFO  L280        TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID
[2020-07-11 02:21:36,352 INFO  L280        TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID
[2020-07-11 02:21:36,352 INFO  L280        TraceCheckUtils]: 6: Hoare triple {13618#true} assume true; {13618#true} is VALID
[2020-07-11 02:21:36,352 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID
[2020-07-11 02:21:36,353 INFO  L263        TraceCheckUtils]: 0: Hoare triple {13618#true} call ULTIMATE.init(); {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:36,353 INFO  L280        TraceCheckUtils]: 1: Hoare triple {13629#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {13618#true} is VALID
[2020-07-11 02:21:36,353 INFO  L280        TraceCheckUtils]: 2: Hoare triple {13618#true} ~m_initVerify~0 := 2; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L280        TraceCheckUtils]: 3: Hoare triple {13618#true} ~m_Signature~0 := 3; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L280        TraceCheckUtils]: 4: Hoare triple {13618#true} ~m_sign~0 := 4; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L280        TraceCheckUtils]: 5: Hoare triple {13618#true} ~m_verify~0 := 5; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L280        TraceCheckUtils]: 6: Hoare triple {13618#true} ~m_update~0 := 6; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L280        TraceCheckUtils]: 7: Hoare triple {13618#true} assume true; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {13618#true} {13618#true} #484#return; {13618#true} is VALID
[2020-07-11 02:21:36,354 INFO  L263        TraceCheckUtils]: 9: Hoare triple {13618#true} call #t~ret21 := main(); {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 10: Hoare triple {13618#true} ~q~0 := 0; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 11: Hoare triple {13618#true} havoc ~method_id~0; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 12: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 13: Hoare triple {13618#true} goto; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 14: Hoare triple {13618#true} assume !false; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 15: Hoare triple {13618#true} assume 0 == ~q~0; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 16: Hoare triple {13618#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13618#true} is VALID
[2020-07-11 02:21:36,355 INFO  L280        TraceCheckUtils]: 17: Hoare triple {13618#true} assume 0 != #t~nondet0; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 18: Hoare triple {13618#true} havoc #t~nondet0; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 19: Hoare triple {13618#true} ~method_id~0 := 3; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 20: Hoare triple {13618#true} assume !false; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 21: Hoare triple {13618#true} ~q~0 := 2; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 22: Hoare triple {13618#true} ~this_state~0 := 0; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 23: Hoare triple {13618#true} assume !false; {13618#true} is VALID
[2020-07-11 02:21:36,356 INFO  L280        TraceCheckUtils]: 24: Hoare triple {13618#true} assume !(0 == ~q~0); {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 25: Hoare triple {13618#true} assume !(1 == ~q~0); {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 26: Hoare triple {13618#true} assume 2 == ~q~0; {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 27: Hoare triple {13618#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 28: Hoare triple {13618#true} assume !(0 != #t~nondet4); {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 29: Hoare triple {13618#true} havoc #t~nondet4; {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 30: Hoare triple {13618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 31: Hoare triple {13618#true} assume 0 != #t~nondet5; {13618#true} is VALID
[2020-07-11 02:21:36,357 INFO  L280        TraceCheckUtils]: 32: Hoare triple {13618#true} havoc #t~nondet5; {13618#true} is VALID
[2020-07-11 02:21:36,358 INFO  L280        TraceCheckUtils]: 33: Hoare triple {13618#true} ~method_id~0 := 2; {13618#true} is VALID
[2020-07-11 02:21:36,358 INFO  L280        TraceCheckUtils]: 34: Hoare triple {13618#true} assume !false; {13618#true} is VALID
[2020-07-11 02:21:36,358 INFO  L280        TraceCheckUtils]: 35: Hoare triple {13618#true} ~q~0 := 4; {13618#true} is VALID
[2020-07-11 02:21:36,358 INFO  L280        TraceCheckUtils]: 36: Hoare triple {13618#true} ~this_state~0 := 3; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,359 INFO  L280        TraceCheckUtils]: 37: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !false; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,359 INFO  L280        TraceCheckUtils]: 38: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,359 INFO  L280        TraceCheckUtils]: 39: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(1 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,360 INFO  L280        TraceCheckUtils]: 40: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(2 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,360 INFO  L280        TraceCheckUtils]: 41: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(3 == ~q~0); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,360 INFO  L280        TraceCheckUtils]: 42: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 4 == ~q~0; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,361 INFO  L280        TraceCheckUtils]: 43: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,361 INFO  L280        TraceCheckUtils]: 44: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,362 INFO  L280        TraceCheckUtils]: 45: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet15; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,362 INFO  L280        TraceCheckUtils]: 46: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,362 INFO  L280        TraceCheckUtils]: 47: Hoare triple {13628#(<= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,363 INFO  L280        TraceCheckUtils]: 48: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet16; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,363 INFO  L280        TraceCheckUtils]: 49: Hoare triple {13628#(<= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,363 INFO  L280        TraceCheckUtils]: 50: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 0 != #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,364 INFO  L280        TraceCheckUtils]: 51: Hoare triple {13628#(<= 3 main_~this_state~0)} havoc #t~nondet17; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,364 INFO  L280        TraceCheckUtils]: 52: Hoare triple {13628#(<= 3 main_~this_state~0)} ~method_id~0 := 4; {13628#(<= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:36,365 INFO  L280        TraceCheckUtils]: 53: Hoare triple {13628#(<= 3 main_~this_state~0)} assume 2 == ~this_state~0; {13619#false} is VALID
[2020-07-11 02:21:36,365 INFO  L280        TraceCheckUtils]: 54: Hoare triple {13619#false} assume !false; {13619#false} is VALID
[2020-07-11 02:21:36,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:36,367 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949029616]
[2020-07-11 02:21:36,367 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:36,367 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:36,367 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279124396]
[2020-07-11 02:21:36,368 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 55
[2020-07-11 02:21:36,368 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:36,368 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:36,418 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:36,419 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:36,419 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:36,419 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:36,419 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:36,420 INFO  L87              Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 4 states.
[2020-07-11 02:21:37,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:37,591 INFO  L93              Difference]: Finished difference Result 158 states and 176 transitions.
[2020-07-11 02:21:37,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:37,592 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 55
[2020-07-11 02:21:37,592 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:37,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:37,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions.
[2020-07-11 02:21:37,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:37,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions.
[2020-07-11 02:21:37,595 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions.
[2020-07-11 02:21:37,850 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:37,853 INFO  L225             Difference]: With dead ends: 158
[2020-07-11 02:21:37,853 INFO  L226             Difference]: Without dead ends: 153
[2020-07-11 02:21:37,853 INFO  L675         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
[2020-07-11 02:21:37,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2020-07-11 02:21:38,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153.
[2020-07-11 02:21:38,499 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:38,499 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 153 states.
[2020-07-11 02:21:38,499 INFO  L74              IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states.
[2020-07-11 02:21:38,499 INFO  L87              Difference]: Start difference. First operand 153 states. Second operand 153 states.
[2020-07-11 02:21:38,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:38,503 INFO  L93              Difference]: Finished difference Result 153 states and 171 transitions.
[2020-07-11 02:21:38,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions.
[2020-07-11 02:21:38,504 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:38,504 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:38,504 INFO  L74              IsIncluded]: Start isIncluded. First operand 153 states. Second operand 153 states.
[2020-07-11 02:21:38,504 INFO  L87              Difference]: Start difference. First operand 153 states. Second operand 153 states.
[2020-07-11 02:21:38,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:38,507 INFO  L93              Difference]: Finished difference Result 153 states and 171 transitions.
[2020-07-11 02:21:38,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions.
[2020-07-11 02:21:38,508 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:38,508 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:38,508 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:38,508 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:38,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2020-07-11 02:21:38,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions.
[2020-07-11 02:21:38,511 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 55
[2020-07-11 02:21:38,511 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:38,511 INFO  L479      AbstractCegarLoop]: Abstraction has 153 states and 171 transitions.
[2020-07-11 02:21:38,512 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:38,512 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions.
[2020-07-11 02:21:38,796 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:38,796 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions.
[2020-07-11 02:21:38,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2020-07-11 02:21:38,797 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-11 02:21:38,799 INFO  L422         BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-11 02:21:38,799 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-07-11 02:21:38,800 INFO  L427      AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-11 02:21:38,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-11 02:21:38,800 INFO  L82        PathProgramCache]: Analyzing trace with hash 1987485698, now seen corresponding path program 1 times
[2020-07-11 02:21:38,800 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-11 02:21:38,800 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211572742]
[2020-07-11 02:21:38,800 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-11 02:21:38,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:38,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-11 02:21:38,867 INFO  L280        TraceCheckUtils]: 0: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID
[2020-07-11 02:21:38,867 INFO  L280        TraceCheckUtils]: 1: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID
[2020-07-11 02:21:38,867 INFO  L280        TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID
[2020-07-11 02:21:38,868 INFO  L280        TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID
[2020-07-11 02:21:38,868 INFO  L280        TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID
[2020-07-11 02:21:38,868 INFO  L280        TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID
[2020-07-11 02:21:38,868 INFO  L280        TraceCheckUtils]: 6: Hoare triple {14563#true} assume true; {14563#true} is VALID
[2020-07-11 02:21:38,869 INFO  L275        TraceCheckUtils]: 7: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID
[2020-07-11 02:21:38,870 INFO  L263        TraceCheckUtils]: 0: Hoare triple {14563#true} call ULTIMATE.init(); {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} is VALID
[2020-07-11 02:21:38,870 INFO  L280        TraceCheckUtils]: 1: Hoare triple {14574#(and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))} ~m_initSign~0 := 1; {14563#true} is VALID
[2020-07-11 02:21:38,870 INFO  L280        TraceCheckUtils]: 2: Hoare triple {14563#true} ~m_initVerify~0 := 2; {14563#true} is VALID
[2020-07-11 02:21:38,870 INFO  L280        TraceCheckUtils]: 3: Hoare triple {14563#true} ~m_Signature~0 := 3; {14563#true} is VALID
[2020-07-11 02:21:38,870 INFO  L280        TraceCheckUtils]: 4: Hoare triple {14563#true} ~m_sign~0 := 4; {14563#true} is VALID
[2020-07-11 02:21:38,871 INFO  L280        TraceCheckUtils]: 5: Hoare triple {14563#true} ~m_verify~0 := 5; {14563#true} is VALID
[2020-07-11 02:21:38,871 INFO  L280        TraceCheckUtils]: 6: Hoare triple {14563#true} ~m_update~0 := 6; {14563#true} is VALID
[2020-07-11 02:21:38,871 INFO  L280        TraceCheckUtils]: 7: Hoare triple {14563#true} assume true; {14563#true} is VALID
[2020-07-11 02:21:38,871 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {14563#true} {14563#true} #484#return; {14563#true} is VALID
[2020-07-11 02:21:38,872 INFO  L263        TraceCheckUtils]: 9: Hoare triple {14563#true} call #t~ret21 := main(); {14563#true} is VALID
[2020-07-11 02:21:38,872 INFO  L280        TraceCheckUtils]: 10: Hoare triple {14563#true} ~q~0 := 0; {14563#true} is VALID
[2020-07-11 02:21:38,872 INFO  L280        TraceCheckUtils]: 11: Hoare triple {14563#true} havoc ~method_id~0; {14563#true} is VALID
[2020-07-11 02:21:38,872 INFO  L280        TraceCheckUtils]: 12: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID
[2020-07-11 02:21:38,872 INFO  L280        TraceCheckUtils]: 13: Hoare triple {14563#true} goto; {14563#true} is VALID
[2020-07-11 02:21:38,873 INFO  L280        TraceCheckUtils]: 14: Hoare triple {14563#true} assume !false; {14563#true} is VALID
[2020-07-11 02:21:38,873 INFO  L280        TraceCheckUtils]: 15: Hoare triple {14563#true} assume 0 == ~q~0; {14563#true} is VALID
[2020-07-11 02:21:38,873 INFO  L280        TraceCheckUtils]: 16: Hoare triple {14563#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14563#true} is VALID
[2020-07-11 02:21:38,873 INFO  L280        TraceCheckUtils]: 17: Hoare triple {14563#true} assume 0 != #t~nondet0; {14563#true} is VALID
[2020-07-11 02:21:38,873 INFO  L280        TraceCheckUtils]: 18: Hoare triple {14563#true} havoc #t~nondet0; {14563#true} is VALID
[2020-07-11 02:21:38,874 INFO  L280        TraceCheckUtils]: 19: Hoare triple {14563#true} ~method_id~0 := 3; {14563#true} is VALID
[2020-07-11 02:21:38,874 INFO  L280        TraceCheckUtils]: 20: Hoare triple {14563#true} assume !false; {14563#true} is VALID
[2020-07-11 02:21:38,874 INFO  L280        TraceCheckUtils]: 21: Hoare triple {14563#true} ~q~0 := 2; {14563#true} is VALID
[2020-07-11 02:21:38,874 INFO  L280        TraceCheckUtils]: 22: Hoare triple {14563#true} ~this_state~0 := 0; {14563#true} is VALID
[2020-07-11 02:21:38,874 INFO  L280        TraceCheckUtils]: 23: Hoare triple {14563#true} assume !false; {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 24: Hoare triple {14563#true} assume !(0 == ~q~0); {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 25: Hoare triple {14563#true} assume !(1 == ~q~0); {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 26: Hoare triple {14563#true} assume 2 == ~q~0; {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 27: Hoare triple {14563#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 28: Hoare triple {14563#true} assume !(0 != #t~nondet4); {14563#true} is VALID
[2020-07-11 02:21:38,875 INFO  L280        TraceCheckUtils]: 29: Hoare triple {14563#true} havoc #t~nondet4; {14563#true} is VALID
[2020-07-11 02:21:38,876 INFO  L280        TraceCheckUtils]: 30: Hoare triple {14563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14563#true} is VALID
[2020-07-11 02:21:38,876 INFO  L280        TraceCheckUtils]: 31: Hoare triple {14563#true} assume 0 != #t~nondet5; {14563#true} is VALID
[2020-07-11 02:21:38,876 INFO  L280        TraceCheckUtils]: 32: Hoare triple {14563#true} havoc #t~nondet5; {14563#true} is VALID
[2020-07-11 02:21:38,876 INFO  L280        TraceCheckUtils]: 33: Hoare triple {14563#true} ~method_id~0 := 2; {14563#true} is VALID
[2020-07-11 02:21:38,876 INFO  L280        TraceCheckUtils]: 34: Hoare triple {14563#true} assume !false; {14563#true} is VALID
[2020-07-11 02:21:38,877 INFO  L280        TraceCheckUtils]: 35: Hoare triple {14563#true} ~q~0 := 4; {14563#true} is VALID
[2020-07-11 02:21:38,877 INFO  L280        TraceCheckUtils]: 36: Hoare triple {14563#true} ~this_state~0 := 3; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,878 INFO  L280        TraceCheckUtils]: 37: Hoare triple {14573#(= 3 main_~this_state~0)} assume !false; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,878 INFO  L280        TraceCheckUtils]: 38: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,879 INFO  L280        TraceCheckUtils]: 39: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(1 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,879 INFO  L280        TraceCheckUtils]: 40: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(2 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,880 INFO  L280        TraceCheckUtils]: 41: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(3 == ~q~0); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,880 INFO  L280        TraceCheckUtils]: 42: Hoare triple {14573#(= 3 main_~this_state~0)} assume 4 == ~q~0; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,881 INFO  L280        TraceCheckUtils]: 43: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,881 INFO  L280        TraceCheckUtils]: 44: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet15); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,882 INFO  L280        TraceCheckUtils]: 45: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet15; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,882 INFO  L280        TraceCheckUtils]: 46: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,883 INFO  L280        TraceCheckUtils]: 47: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet16); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,883 INFO  L280        TraceCheckUtils]: 48: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet16; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,884 INFO  L280        TraceCheckUtils]: 49: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,884 INFO  L280        TraceCheckUtils]: 50: Hoare triple {14573#(= 3 main_~this_state~0)} assume !(0 != #t~nondet17); {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,885 INFO  L280        TraceCheckUtils]: 51: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet17; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,885 INFO  L280        TraceCheckUtils]: 52: Hoare triple {14573#(= 3 main_~this_state~0)} assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,886 INFO  L280        TraceCheckUtils]: 53: Hoare triple {14573#(= 3 main_~this_state~0)} assume 0 != #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,886 INFO  L280        TraceCheckUtils]: 54: Hoare triple {14573#(= 3 main_~this_state~0)} havoc #t~nondet18; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,887 INFO  L280        TraceCheckUtils]: 55: Hoare triple {14573#(= 3 main_~this_state~0)} ~method_id~0 := 5; {14573#(= 3 main_~this_state~0)} is VALID
[2020-07-11 02:21:38,887 INFO  L280        TraceCheckUtils]: 56: Hoare triple {14573#(= 3 main_~this_state~0)} assume 3 != ~this_state~0; {14564#false} is VALID
[2020-07-11 02:21:38,887 INFO  L280        TraceCheckUtils]: 57: Hoare triple {14564#false} assume !false; {14564#false} is VALID
[2020-07-11 02:21:38,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-07-11 02:21:38,890 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211572742]
[2020-07-11 02:21:38,891 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-11 02:21:38,891 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-11 02:21:38,891 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063457507]
[2020-07-11 02:21:38,891 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 58
[2020-07-11 02:21:38,892 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-11 02:21:38,892 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-11 02:21:38,940 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:38,941 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-11 02:21:38,941 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-11 02:21:38,941 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-11 02:21:38,942 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-11 02:21:38,942 INFO  L87              Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 4 states.
[2020-07-11 02:21:40,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:40,074 INFO  L93              Difference]: Finished difference Result 243 states and 275 transitions.
[2020-07-11 02:21:40,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-11 02:21:40,074 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 58
[2020-07-11 02:21:40,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-11 02:21:40,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:40,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions.
[2020-07-11 02:21:40,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-11 02:21:40,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions.
[2020-07-11 02:21:40,082 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 267 transitions.
[2020-07-11 02:21:40,385 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:40,385 INFO  L225             Difference]: With dead ends: 243
[2020-07-11 02:21:40,385 INFO  L226             Difference]: Without dead ends: 0
[2020-07-11 02:21:40,386 INFO  L675         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
[2020-07-11 02:21:40,387 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-11 02:21:40,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-11 02:21:40,387 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-11 02:21:40,387 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-11 02:21:40,387 INFO  L74              IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-11 02:21:40,387 INFO  L87              Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-11 02:21:40,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:40,388 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-11 02:21:40,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-11 02:21:40,388 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:40,388 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:40,388 INFO  L74              IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-11 02:21:40,389 INFO  L87              Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-11 02:21:40,389 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-11 02:21:40,389 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-11 02:21:40,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-11 02:21:40,389 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:40,389 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-11 02:21:40,389 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-11 02:21:40,389 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-11 02:21:40,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-11 02:21:40,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-11 02:21:40,390 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58
[2020-07-11 02:21:40,390 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-11 02:21:40,390 INFO  L479      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-11 02:21:40,390 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-11 02:21:40,390 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2020-07-11 02:21:40,390 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-11 02:21:40,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-11 02:21:40,390 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-11 02:21:40,391 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-07-11 02:21:40,393 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-11 02:21:43,829 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.initFINAL(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,829 INFO  L271        CegarLoopResult]: At program point  L10(line 10)  the Hoare annotation is:  true
[2020-07-11 02:21:43,830 INFO  L264        CegarLoopResult]: At program point  ULTIMATE.initENTRY(line -1)  the Hoare annotation is:  (and (= ~m_initSign~0 |old(~m_initSign~0)|) (= ~m_verify~0 |old(~m_verify~0)|) (= ~m_Signature~0 |old(~m_Signature~0)|) (= ~m_sign~0 |old(~m_sign~0)|) (= ~m_initVerify~0 |old(~m_initVerify~0)|) (= ~m_update~0 |old(~m_update~0)|))
[2020-07-11 02:21:43,830 INFO  L271        CegarLoopResult]: At program point  L9(line 9)  the Hoare annotation is:  true
[2020-07-11 02:21:43,830 INFO  L271        CegarLoopResult]: At program point  L8(line 8)  the Hoare annotation is:  true
[2020-07-11 02:21:43,830 INFO  L271        CegarLoopResult]: At program point  L7(line 7)  the Hoare annotation is:  true
[2020-07-11 02:21:43,830 INFO  L271        CegarLoopResult]: At program point  L6(line 6)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.initEXIT(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.startEXIT(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  L-1(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.startENTRY(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  ULTIMATE.startFINAL(line -1)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L271        CegarLoopResult]: At program point  mainEXIT(lines 13 390)  the Hoare annotation is:  true
[2020-07-11 02:21:43,831 INFO  L264        CegarLoopResult]: At program point  L366(lines 366 377)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L300(line 300)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L300-1(lines 300 315)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L234(lines 234 245)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0)))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L300-2(line 300)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L300-3(line 300)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,832 INFO  L264        CegarLoopResult]: At program point  L102(lines 102 113)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L334(lines 334 345)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L268(line 268)  the Hoare annotation is:  false
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L202(lines 202 213)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L70(lines 70 72)  the Hoare annotation is:  false
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L368(line 368)  the Hoare annotation is:  false
[2020-07-11 02:21:43,833 INFO  L264        CegarLoopResult]: At program point  L302(lines 302 313)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,833 INFO  L271        CegarLoopResult]: At program point  mainFINAL(lines 13 390)  the Hoare annotation is:  true
[2020-07-11 02:21:43,834 INFO  L264        CegarLoopResult]: At program point  L170(lines 170 172)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,834 INFO  L264        CegarLoopResult]: At program point  L38(line 38)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,834 INFO  L264        CegarLoopResult]: At program point  L270(lines 270 272)  the Hoare annotation is:  false
[2020-07-11 02:21:43,834 INFO  L264        CegarLoopResult]: At program point  L138(lines 138 140)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,834 INFO  L264        CegarLoopResult]: At program point  L370(lines 370 372)  the Hoare annotation is:  false
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L238(lines 238 240)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0)))
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L106(lines 106 108)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L40(line 40)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L371(lines 13 390)  the Hoare annotation is:  false
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L338(lines 338 340)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L206(lines 206 208)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,835 INFO  L271        CegarLoopResult]: At program point  L74(line 74)  the Hoare annotation is:  true
[2020-07-11 02:21:43,835 INFO  L264        CegarLoopResult]: At program point  L306(lines 306 308)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,836 INFO  L271        CegarLoopResult]: At program point  L174(line 174)  the Hoare annotation is:  true
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L274(line 274)  the Hoare annotation is:  false
[2020-07-11 02:21:43,836 INFO  L271        CegarLoopResult]: At program point  L142(line 142)  the Hoare annotation is:  true
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L374(line 374)  the Hoare annotation is:  false
[2020-07-11 02:21:43,836 INFO  L271        CegarLoopResult]: At program point  L242(line 242)  the Hoare annotation is:  true
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L110(line 110)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L342(line 342)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L276(line 276)  the Hoare annotation is:  false
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L210(line 210)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L376(line 376)  the Hoare annotation is:  false
[2020-07-11 02:21:43,836 INFO  L264        CegarLoopResult]: At program point  L310(line 310)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L112(line 112)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389)  the Hoare annotation is:  false
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L344(line 344)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L212(line 212)  the Hoare annotation is:  (<= 4 main_~q~0)
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L80(line 80)  the Hoare annotation is:  false
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L47(lines 47 98)  the Hoare annotation is:  (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0)))
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L80-1(lines 80 95)  the Hoare annotation is:  false
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L80-2(line 80)  the Hoare annotation is:  false
[2020-07-11 02:21:43,837 INFO  L264        CegarLoopResult]: At program point  L80-3(line 80)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L312(line 312)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L48(line 48)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L48-1(lines 48 63)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L48-2(line 48)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L48-3(line 48)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L148(line 148)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L148-1(lines 148 163)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L82(lines 82 93)  the Hoare annotation is:  false
[2020-07-11 02:21:43,838 INFO  L264        CegarLoopResult]: At program point  L148-2(line 148)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L148-3(line 148)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L16(line 16)  the Hoare annotation is:  (= 0 main_~q~0)
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L248(line 248)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L248-1(lines 248 263)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L248-2(line 248)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L248-3(line 248)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L116(line 116)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,839 INFO  L264        CegarLoopResult]: At program point  L116-1(lines 116 131)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L50(lines 50 61)  the Hoare annotation is:  false
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L116-2(line 116)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L116-3(line 116)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L381(lines 22 385)  the Hoare annotation is:  (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and .cse0 (= 2 main_~q~0))))
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L348(line 348)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L348-1(lines 348 363)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,840 INFO  L264        CegarLoopResult]: At program point  L348-2(line 348)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L348-3(line 348)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L216(line 216)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L183(lines 183 282)  the Hoare annotation is:  (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L216-1(lines 216 231)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L150(lines 150 161)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L216-2(line 216)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,841 INFO  L264        CegarLoopResult]: At program point  L216-3(line 216)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L316(line 316)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L283(lines 283 382)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L316-1(lines 316 331)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L250(lines 250 261)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L316-2(line 316)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0)))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L316-3(line 316)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L184(line 184)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,842 INFO  L264        CegarLoopResult]: At program point  L184-1(lines 184 199)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L118(lines 118 129)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L184-2(line 184)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L184-3(line 184)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L19(line 19)  the Hoare annotation is:  (= 0 main_~q~0)
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L350(lines 350 361)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L284(line 284)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L284-1(lines 284 299)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L218(lines 218 229)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L284-2(line 284)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,843 INFO  L264        CegarLoopResult]: At program point  L284-3(line 284)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L86(lines 86 88)  the Hoare annotation is:  false
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L318(lines 318 329)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0)))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L252(line 252)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L186(lines 186 197)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L54(lines 54 56)  the Hoare annotation is:  false
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L352(line 352)  the Hoare annotation is:  false
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L286(lines 286 297)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L154(lines 154 156)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L22-2(lines 22 385)  the Hoare annotation is:  (or (and (= 0 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)))
[2020-07-11 02:21:43,844 INFO  L271        CegarLoopResult]: At program point  L22-3(lines 22 385)  the Hoare annotation is:  true
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L254(lines 254 256)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,844 INFO  L264        CegarLoopResult]: At program point  L122(lines 122 124)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L354(lines 354 356)  the Hoare annotation is:  false
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L222(lines 222 224)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,845 INFO  L271        CegarLoopResult]: At program point  L90(line 90)  the Hoare annotation is:  true
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L322(lines 322 324)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 4 main_~q~0) (<= 3 main_~this_state~0)))
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L190(lines 190 192)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,845 INFO  L271        CegarLoopResult]: At program point  L58(line 58)  the Hoare annotation is:  true
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L290(lines 290 292)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,845 INFO  L271        CegarLoopResult]: At program point  L158(line 158)  the Hoare annotation is:  true
[2020-07-11 02:21:43,845 INFO  L264        CegarLoopResult]: At program point  L258(line 258)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L126(line 126)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L27(lines 27 46)  the Hoare annotation is:  (let ((.cse0 (<= main_~this_state~0 0))) (or (and (= 0 main_~q~0) .cse0) (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= 2 main_~q~0))))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L358(line 358)  the Hoare annotation is:  false
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L226(line 226)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L28(line 28)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L28-1(lines 28 43)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L28-2(line 28)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,846 INFO  L264        CegarLoopResult]: At program point  L28-3(line 28)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,846 INFO  L271        CegarLoopResult]: At program point  L326(line 326)  the Hoare annotation is:  true
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L260(line 260)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L194(line 194)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L128(line 128)  the Hoare annotation is:  (<= 4 main_~q~0)
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L360(line 360)  the Hoare annotation is:  false
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L294(line 294)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L228(line 228)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L30(lines 30 41)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,847 INFO  L271        CegarLoopResult]: At program point  mainENTRY(lines 13 390)  the Hoare annotation is:  true
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L196(line 196)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L64(line 64)  the Hoare annotation is:  false
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L64-1(lines 64 79)  the Hoare annotation is:  false
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L64-2(line 64)  the Hoare annotation is:  false
[2020-07-11 02:21:43,847 INFO  L264        CegarLoopResult]: At program point  L64-3(line 64)  the Hoare annotation is:  false
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L296(line 296)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L164(line 164)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L164-1(lines 164 179)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L164-2(line 164)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L164-3(line 164)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L264(line 264)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L264-1(lines 264 279)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L264-2(line 264)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L264-3(line 264)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L132(line 132)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L99(lines 99 182)  the Hoare annotation is:  (or (and (<= 4 main_~q~0) (= 3 main_~this_state~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and (<= main_~this_state~0 0) (= 2 main_~q~0)))
[2020-07-11 02:21:43,848 INFO  L264        CegarLoopResult]: At program point  L132-1(lines 132 147)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L66(lines 66 77)  the Hoare annotation is:  false
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L132-2(line 132)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L132-3(line 132)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L364(line 364)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L364-1(lines 364 379)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L364-2(line 364)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L364-3(line 364)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L232(line 232)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L232-1(lines 232 247)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L166(lines 166 177)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L232-2(line 232)  the Hoare annotation is:  (or (and (<= 2 main_~q~0) (<= main_~this_state~0 0)) (and (<= 3 main_~q~0) (= 2 main_~this_state~0)))
[2020-07-11 02:21:43,849 INFO  L264        CegarLoopResult]: At program point  L232-3(line 232)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L100(line 100)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L100-1(lines 100 115)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L34(lines 34 36)  the Hoare annotation is:  (and (= 0 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L100-2(line 100)  the Hoare annotation is:  (= 2 main_~q~0)
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L100-3(line 100)  the Hoare annotation is:  (and (<= main_~this_state~0 0) (= 2 main_~q~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L332(line 332)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L332-1(lines 332 347)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L266(lines 266 277)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L332-2(line 332)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L332-3(line 332)  the Hoare annotation is:  (and (<= 4 main_~q~0) (= 3 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L200(line 200)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L200-1(lines 200 215)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,850 INFO  L264        CegarLoopResult]: At program point  L134(lines 134 145)  the Hoare annotation is:  (and (<= 2 main_~q~0) (<= main_~this_state~0 0))
[2020-07-11 02:21:43,851 INFO  L264        CegarLoopResult]: At program point  L200-2(line 200)  the Hoare annotation is:  (= 3 main_~q~0)
[2020-07-11 02:21:43,851 INFO  L264        CegarLoopResult]: At program point  L200-3(line 200)  the Hoare annotation is:  (and (= 3 main_~q~0) (= 2 main_~this_state~0))
[2020-07-11 02:21:43,942 INFO  L163   areAnnotationChecker]: CFG has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-11 02:21:43,971 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:21:43 BoogieIcfgContainer
[2020-07-11 02:21:43,972 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-11 02:21:43,976 INFO  L168              Benchmark]: Toolchain (without parser) took 37824.31 ms. Allocated memory was 143.1 MB in the beginning and 528.0 MB in the end (delta: 384.8 MB). Free memory was 101.0 MB in the beginning and 409.6 MB in the end (delta: -308.6 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,976 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.1 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,977 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 432.55 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 178.8 MB in the end (delta: -78.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,982 INFO  L168              Benchmark]: Boogie Preprocessor took 90.98 ms. Allocated memory is still 200.3 MB. Free memory was 178.8 MB in the beginning and 176.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,983 INFO  L168              Benchmark]: RCFGBuilder took 865.07 ms. Allocated memory is still 200.3 MB. Free memory was 176.4 MB in the beginning and 111.6 MB in the end (delta: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,984 INFO  L168              Benchmark]: TraceAbstraction took 36421.03 ms. Allocated memory was 200.3 MB in the beginning and 528.0 MB in the end (delta: 327.7 MB). Free memory was 110.5 MB in the beginning and 409.6 MB in the end (delta: -299.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB.
[2020-07-11 02:21:43,988 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - AssertionsEnabledResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.26 ms. Allocated memory is still 143.1 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 432.55 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 178.8 MB in the end (delta: -78.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 90.98 ms. Allocated memory is still 200.3 MB. Free memory was 178.8 MB in the beginning and 176.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 865.07 ms. Allocated memory is still 200.3 MB. Free memory was 176.4 MB in the beginning and 111.6 MB in the end (delta: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 36421.03 ms. Allocated memory was 200.3 MB in the beginning and 528.0 MB in the end (delta: 327.7 MB). Free memory was 110.5 MB in the beginning and 409.6 MB in the end (delta: -299.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable
    For all program executions holds that call of __VERIFIER_error() unreachable at this location
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 22]: Loop Invariant
    Derived loop invariant: (((0 == q && this_state <= 0) || (3 == q && 2 == this_state)) || (4 <= q && 3 == this_state)) || (this_state <= 0 && 2 == q)
  - InvariantResult [Line: 13]: Loop Invariant
    Derived loop invariant: 0
  - InvariantResult [Line: 22]: Loop Invariant
    Derived loop invariant: (0 == q && this_state <= 0) || (4 <= q && 3 == this_state)
  - ProcedureContractResult [Line: 13]: Procedure Contract for main
    Derived contract for procedure main: 1
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 2887 SDslu, 123 SDs, 0 SdLazy, 1238 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 191 LocationsWithAnnotation, 191 PreInvPairs, 355 NumberOfFragments, 1069 HoareAnnotationTreeSize, 191 FomulaSimplifications, 3354 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 191 FomulaSimplificationsInter, 3787 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 39149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 56/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...